- Be the last player to move.
This puzzle can be solved using the following concepts. Practice using these concepts and improve your skills.
The game is played on a 8x8 board. In the initial position, all squares are occupied by a stone, with white stones on the white squares and black stones on the black squares.How to play:
- A player moves by picking up one of their stones and "clobbering" an opponent's stone on an adjacent square (horizontally or vertically). The "clobbered" stone is removed from the board and replaced by the stone that was moved.
The game ends when one player, on their turn, is unable to move, and then that player loses.Ending a turn:
- A bot must output the coordinates of the piece he wants to move followed by its destination coordinates. Coordinates are expressed in chess notation e.g. "e2e3"
- If the starting or destination coordinates are outside of the board,
- If the starting square is occupied by an opponent stone,
- If the destination square is empty or occupied by an own piece,
the game will end and the other player will win.
- Have no legal moves.
- You do not respond in time or output an unrecognized command.
Next line:color: the color of your pieces (
Next line: lastAction: the last action made by the opponent ("null" if it's the first turn).
Next line: actionsCount: the number of legal actions for this turn.
- You can display a (short) comment in the viewer by adding a space after the move and writing its content, e.g. "e2e3 message".
- You can play a random move by outputting
randominstead of a move. This is admittedly only useful for stub code generation.
Response time per turn is ≤
A higher resolution is required to access the IDE