It would take us too long to implement a full chess game algorithm here, so instead, we will settle for a much simpler game called Fox and Hounds. One of the players has four pawns (hounds), which can only move over black fields and the pawn can only move in a forward fashion (toward higher ranks). The other player has just a single pawn (fox), which starts from the opposite side of the board:
It can also move only over black fields; however it can move both forward (toward higher ranks) as well as backward (toward lower ranks). Players move their pawns in turn. The goal of the fox is to reach ...
