My mental map
Once the scoring was disclosed, I quickly understood the problem as three optimization vectors. First, the robot policy — what each of the 96 robots decides to do next: the algorithm, the routing, the collisions. Second, the shelf organization: where each of the 960 shelves actually sit. Third, and the least glamorous, how fast you can iterate: we were given out the verification code that runs a candidate and hands back a number, but no one said it's fully optimized, and faster iterations means more iterations, which means better solutions, faster.
Before the competition started, Mihura added a fourth vector to optimize: exploits were fair game. If the simulator let you do it, it counted. There were some safety guardrails, like an LLM that scanned for malicious code, but anything that passed that was ok. This was a big optimization vector, but a hard one to get with LLMs, as they are not happy to investigate and share where the setup leaks, even if it would be fair game.
In a traditional hackathon, with only 4 hours on the clock, you would really have to prioritize which optimization vector is the most advantageous at each point in time. You can't clone yourself and explore all 4 at the same time. With coding agents, you very well can, and that's exactly what we did.