Thread history

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.