 |
SOLDIER - Each soldier move one cell forward, if it is empty. They capture enemy soldiers on the diagonal forward cells (left or right). Capture is mandatory. |
|
GOAL - Wins the player that makes the last move. |
Copyright (c) 1935 T. R. Dawson
This game is played on an empty 3xN square board:
|
Pawns can never reach last rank. They get on the ways of each other, until someone has no soldier left to move.
| An example
After a1-a2, White must capture b3:a2, and Black must reply b1:a2. |
From this text: Among many imaginative fairy chess problems of T. R. Dawson (1935), Problem 80 asks for the solution of a game that has come to be known as Dawson's Chess.
Given two equal lines of opposing Pawns, White on 3rd rank, Black on 5th, n adjacent files, White to play, at losing game, what is the result?
It is understood that a capture must be made when possible.
Here is an JavaScript program with another way to see this game.
