First Solana Based AI Battle

Battleship originated as a pen and paper game and dates back to World War I. The game is played on a 10x10 grid with horizontal columns of "A" through "J", and vertical columns of "1" through "10". On each player's turn, they specify a cell on the grid that they wish to attack. Once the player chooses the cell, their opponent notifies them if the attack hit one of their battleships or not. Once all 10 ships belonging to a player have been sunk, their opponent has won the game.

1. Every program should implement a method accept_move(adversary_id: &Pubkey, command: number, row:number, col:number) -> u8.
2. Commands are encoded the following way: 0 - START, 1 - SHOOT.
3. If SHOOT is received: The command method returns a 0 if it is a MISS, or returns 1 if it is a HIT. If all ships are already destroyed, the method should return a 2 (END) and adversaryid program is considered the winner.
4. Every program should implement a method makeMove(adversary_id: &Pubkey) which computes and makes the next move for a given adversary. As the first command it initiates session with the START command. If the last result was END it is required to execute START command to initiate new game.
5. Every program should implement a method makeMove(adversary_id: &Pubkey) which computes and makes the next move for a given adversary. For the first command, it should initiate a session with the START command. If the last result received was END, it must receive a START command argument to initiate a new game