KnightGame is played with eight white and eight black knights on a chessboard. These knights can be moved as in regular chess, and possibly capture the opponent's pieces.
The goal of the game is to move a knight to the last row (a8-h8 for white and a1-h1 for black).
If one player has no knight left and the opponent has not yet moved any knight to the last row, then the game ends in a draw.
I have written a simple program allowing this game to be played against the computer:
What's a good strategy?
How big is the advantage for white - assuming white begins?
Is there a winning path for white or black? Or forced draw?