2026.11November 2026openthis month
Charge Counter
Each year, robots participate in a national Overload championship. Each robot builds up a charge by drawing charge from a power source. Every charge drawn adds a random amount, uniform on , to the robot's total, and after each draw the robot decides whether it wants to continue or stop.
A robot whose total goes over overloads. If exactly one robot overloads, the other wins. If neither does, the robot with more total charge wins. If both robots overload, the win is determined randomly by coin flip. The robot who wins advances to the next stage in a single-eliminiation bracket.
The game is played in isolated rooms, and both totals are revealed at end, so neither robot learns anything about the other's charge. After many years of increasingly optimized play, every participant has settled into a Nash equilibrium.
Recently, a new robot called Ω has been dominant in its matches. After some investigation, you've discovered that it has an electromagnetic sensor: while not calibrated finely enough to detect the exact number of charge added, it can detect through the wall whenever its opponent draws charge and thus knows how many times its opponent chooses to draw. Assuming that its opponent will always play towards Nash equilibrium, it responds by maximizing its chance of winning.
You're about to go up against Ω, and you play first. With optimal play, what is your probability of winning? Give your answer to four decimal places.
solved by2
- 01why we cant have nice things
- 02zendotexe