Two robots start in an n by n board on the same cell.There are a number of different fruits lying around on the board (apples, bananas, etc.)
There will be a different number of fruits for each item, so for example, there might be one apple, three bananas and five melons.
![]() | ![]() | ![]() | ![]() | ![]() | ![]() |
![]() | ![]() | ![]() | ![]() | ![]() | ![]() |
![]() | ![]() | ![]() | ![]() | ![]() | ![]() |
![]() | ![]() | ![]() | ![]() | ![]() | ![]() |
![]() | ![]() | ![]() | ![]() | ![]() | ![]() |
![]() | ![]() | ![]() | ![]() | ![]() | ![]() |
Your goal is to collect fruits so that at the end, you have more fruits than your opponent in as many categories as possible.
So if this is the initial count:
apples | bananas | melons |
1 | 3 | 5 |
And after the game, you collected this:
apples | bananas | melons |
0 | 2 | 3 |
Then if your opponent had collected everything else, he would have this:
apples | bananas | melons |
1 | 1 | 2 |
Hence you will have won the game! (Your opponent has both less bananas as well as less melons than you- so you win in two out of three categories, and hence in total.)
Every turn, each player gets to either move to a vertically or horizontally adjacent square (north, east, south or west) or pick up the fruit they're standing on. Moves are made simultaneously.
Both players tell the game server where they want to move, and then both moves are made at the same time.
If both bots are standing on the same fruit and both choose to pick it up, each player gets half a point (0.5). (Notice that this is, from a game-theoretic standpoint of view, equivalent to the fruit being destroyed on simultaneous pick-up)
The game ends if any of these condititions are met:
Fine with the rules? Learn how to write a bot!