New Rumble Categories

Time-based Rumble Types Proposal

The conversation is about the possibility of adding new rumble types in Robocode that are limited by time per tick instead of code size. Some participants suggest that this would encourage bots to make more time tradeoff decisions and could potentially lead to more diverse strategies. However, there are concerns about how to categorize these bots and the difficulty of accurately measuring time per tick. Some suggest using a fixed tick time competition, while others point out that the Robocode engine's control over CPU time is not precise enough for this task. There is also mention of the possibility of using Java bytecode instrumentation to assign fixed costs to different Java bytecode instructions, but this is seen as too complicated to implement.

-- ChatGPT

I don't think code size is a good limiter for different rumble types, because it forces people to do all sorts of tricks which results in very difficult to understand code. In addition, code size is so small compared to memory now that it hardly seems relevant in most cases. What if new rumble types were added where time per tick is the limiting factor: QuickRumble, with half the time, FastRumble 1/4, HyperRumble 1/8, SlowRumble 2x, etc. (Names are arbitrary) This would mean bots in faster rumbles would have to make more time tradeoff decisions, (less precise prediction? more approximate GFs?), and perhaps bots in slower rumbles could find a use for non-KNN classification schemes that required more time. What do you think?

I'm not advocating the destruction of the codesize limited rumbles, just the addition of time limited ones.

The problem is categorizing them. Right now they are automatically sorted into the categories, since codesize is a compile time constant. However time limiting is a run time value. You would have to run a number of battles to place a robot. Even then you need to decide if something that is under the certain limit 99.9% of the time but over 0.1% of the time should be in which category, and so forth.

Well, we can make a time tick fixed competitions. Every one participate but bots which designed with time constrains in mind will sort to the top by themselves.

I think it is analogous to current size based system: nano bots participate in mega bots competitions and have good chances, but it is not true in reverse. Though here we can participant selection in advance.

So all we need is good tick measure, which is not that easy with current CPU which tend to throttle and boost their performance.

In my model, you could submit any bot to any category, but it would skip turns if it took too long for that category. So time limits implemented the same way they are now, but with different categories.

The problem I have with this idea, is that the Robocode engine's control over CPU time is far too approximate for that task.

The nature of such a league is to encourage people to push the limit of the alotted CPU time, however one can expect the calibration of CPU time to be off by wide margins between different computers, or even different runs on the same computer.

If one wants to have a league where the CPU time is a primary design constraint for bots, we need an engine with more precise management of this, such as by using Java bytecode instrumentation to assign fixed costs to different Java bytecode instructions... but that... that gets very complicated to implement.

I agree that would be the best way, and also very expensive to implement. If the VM itself tracked it, that would be another story, but as far as I know, it doesn't.

what would happen if the VM itself tracked it