This game would be somewhat of a cross between Go and Conway's Game of Life...
The game would be played on a toroidal NxN board (that is, the edges wrap around). I suggest N=25. One bot plays red, the other plays blue. The board begins empty. On each turn, each bot simultaneously chooses an empty square on which to place a token.
After every turn beginning with turn #10, the board changes according to the following rules:
- Any square which contains a token and is surrounded by exactly 0, 1, or 4 squares which also contain a token (diagonal squares are not counted), has its token removed.
- Any square surrounded by exactly 2 squares containing tokens remains unaltered.
- Any square surrounded by exactly 3 squares containing tokens has a token placed on it of the same color as that of the plurality of surrounding tokens.
If both bots choose the same square, no tokens are placed and the above process occurs once even if it is not yet turn #10.
The game ends after a fixed number of turns and the bot with the most tokens of its own color wins. If the board empties completely after turn #10, the game ends in a draw. |
