Chessence
Chessence is a chess variant invented by Jim Winslow in 1989.[1][2] The board is a 6×9 rectangle of squares with eight squares missing (blackened out in the diagram). Each player has a king and nine men with initial setup as shown, including three men initially not yet in play at the side of the board. To win, a player must checkmate or stalemate the opponent.
Game rules
In Chessence, kings do not move and must remain fixed on their starting squares the entire game. (Thus, a king is unable to move out of check.) A man has capability to move based on its relative position to other friendly men on the board, as follows:
- If a man is orthogonally adjacent to a friendly man, then both have the ability to move as a rook in chess.
- If a man is diagonally adjacent to a friendly man, then both have the ability to move as a chess bishop.
- If a man is a knight's move away from a friendly man, then both have the ability to move as a knight.
A man with more than one position relationship has the ability to move in more than one way. Likewise, if a man has no position relationship defined above, that man cannot move. The king has no bearing on how the other men may move.
A man may not move to, nor through, a non-existent (blackened-out) square; except that a man moving as a knight may jump over a non-existent square. For a turn, a player may move a man on the board, or alternatively, he may put one of his reserve men in play by placing it on any of his six initial starting squares that is currently open.
Checks, checkmate, and captures are as in standard chess. But if a player has no legal move, he loses the game.
See also
- Beirut Chess—another chess variant by Jim Winslow
References
- ↑ Pritchard (1994), p. 54
- ↑ Pritchard (2007), p. 296
Bibliography
- Lua error in package.lua at line 80: module 'strict' not found.
- Lua error in package.lua at line 80: module 'strict' not found.
External links
- Chessence by Peter Aronson, The Chess Variant Pages
- Chessence a simple program by Ed Friedlander (Java)