Grand chess
Grand chess is a large-board chess variant invented by Dutch games designer Christian Freeling in 1984.[1][2] It is played on a 10×10 board, with each side having two additional pawns and two new pieces: the marshal and the cardinal.
The marshal (M) combines powers of a rook and a knight. The cardinal (C) combines powers of a bishop and a knight.
a | b | c | d | e | f | g | h | i | j | |||
10 | 10 | |||||||||||
9 | 9 | |||||||||||
8 | 8 | |||||||||||
7 | 7 | |||||||||||
6 | 6 | |||||||||||
5 | 5 | |||||||||||
4 | 4 | |||||||||||
3 | 3 | |||||||||||
2 | 2 | |||||||||||
1 | 1 | |||||||||||
a | b | c | d | e | f | g | h | i | j |
A superficial similarity exists between grand chess and an early version of the historic chess variant Capablanca chess because the same pieces and game board are used. But differences in start position, rules governing pawn moves and promotion, and castling make them significantly different games.
A series of Grand Chess Cyber World Championship matches was sponsored by the Dutch game site Mindsports.[lower-alpha 1] Past title holders included R. Wayne Schmittberger (1998, 1999) and John Vehre (2001). Grand chess tournaments were held annually beginning in 1998 by the (now defunct) correspondence game club NOST.[lower-alpha 2]
Rules
The pieces are placed on the players' first and second ranks, respectively, with the rooks alone on the players' first ranks. The pawns are placed on the players' third ranks. Since the rooks are not blocked as much by the other pieces as in standard chess, it is easier for them to activate earlier in the game.
A pawn that reaches a player's eighth or ninth ranks can elect to either promote or remain a pawn, but it must promote upon reaching the tenth rank. Unlike standard chess, a pawn may be promoted only to a captured piece of the same colour. (So, it is impossible for either side to own two queens, or two marshals, or three rooks, etc.) If, and for as long as, no captured piece is available to promote to, a pawn on a player's ninth rank must stay on the ninth rank, but it can still give check.
As in standard chess: pawns can move one or two squares on their first move; pawns can capture en passant; checkmate is a win; stalemate is a draw. There is no castling in grand chess.[lower-alpha 3]
Play examples
Vehre vs. Schmittberger, 2001
a | b | c | d | e | f | g | h | i | j | |||
10 | 10 | |||||||||||
9 | 9 | |||||||||||
8 | 8 | |||||||||||
7 | 7 | |||||||||||
6 | 6 | |||||||||||
5 | 5 | |||||||||||
4 | 4 | |||||||||||
3 | 3 | |||||||||||
2 | 2 | |||||||||||
1 | 1 | |||||||||||
a | b | c | d | e | f | g | h | i | j |
Played between John Vehre and R. Wayne Schmittberger at the 2001 Grand Chess Cyber Championship Final:[3]
- 1.f5 f6 2.Nh4 Nh7 3.g4 g7 4.Nc4 Nc7 5.d4 d7 6.e5 Bd8! 7.Rje1 Kd10 8.Kf1 fxe5 9.Ncxe5?! Kc9 10.Re2? Kb9 11.Kg1 Rjf10 12.Bd3 e6 13.Rf1 Mh10?! 14.Nc4 Ci10 15.Nd6 exf5 16.Bxf5 Bd5 17.Ci1 Bxh4 18.ixh4 g6? 19.Rfe1 gxf5 20.Nxf5! Qd8 21.Bxc7 Qxc7 22.Re9+ Kc10 23.Cxc7 bxc7 24.Qf4 d6 25.Qe3 Mg8 26.Me2 Nf6 27.Qe7 Nd7 28.Qe8+ Mxe8 29.Mxe8 1–0 [Annotations by Vehre]
Composition
a | b | c | d | e | f | g | h | i | j | |||
10 | 10 | |||||||||||
9 | 9 | |||||||||||
8 | 8 | |||||||||||
7 | 7 | |||||||||||
6 | 6 | |||||||||||
5 | 5 | |||||||||||
4 | 4 | |||||||||||
3 | 3 | |||||||||||
2 | 2 | |||||||||||
1 | 1 | |||||||||||
a | b | c | d | e | f | g | h | i | j |
Strategy
H. G. Muller suggested the following estimated piece values:[4]
pawn | 0.85 |
knight | 2.75 |
bishop | 3.25 (+0.5 for the bishop pair) |
rook | 5 |
cardinal | 8.5 |
marshal | 9 |
queen | 9.5 |
See also
- Capablanca Chess
- Embassy Chess
Notes
- www.mindsports.nl
- NOST (kNights Of the Square Table), formed in 1960 by Bob Lauzon and Jim France, held an annual convention and enjoyed several hundred active members (Pritchard 1994:210).
- "We're so used to castling that we tend to forget that it is the weirdest move in Chess, implemented specifically to solve a problem. Chess turned out a great game despite its problem, but it needed an ad hoc fix to do so. In grand chess, pawns retain their usual distance and rooks are free from the onset, so the problem doesn't exist in the first place." (Freeling)
References
- Bodlaender, Hans; Brown, John William. "Christian Freeling's Grand Chess". The Chess Variant Pages. Archived from the original on 2011-05-14. Retrieved 2008-12-13.
- Dylan Loeb McClain (2007-08-19). "Giraffes, Viziers and Wizards: Variations on the Old Game". The New York Times. Retrieved 2008-12-07.
- http://www.samiam.org/grandchess/2001-VS.pdf
- http://www.chessvariants.com/index/displaycomment.php?commentid=28113
Bibliography
- Hochberg, Burt (August 1997). "Don't be Scared, It's Still Chess". Chess Life.
- Pritchard, D. B. (1994). The Encyclopedia of Chess Variants. Games & Puzzles Publications. ISBN 0-9524142-0-1.
Further reading
- Beasley, John D., ed. (January 2010). "Grand Chess". Variant Chess. Vol. 8 no. 63. British Chess Variants Society. pp. 142–44. ISSN 0958-8248.
- Gardner, Tony (2000–2002). Handscomb, Kerry (ed.). "The Grand Chess Corner". Abstract Games. No. 3–12. Carpe Diem Publishing. ISSN 1492-0492.
- Horne, Malcolm (Spring 1996). Wood, Peter C. (ed.). "Grand Chess". Variant Chess. Vol. 2 no. 19. British Chess Variants Society. pp. 181–82, 184. ISSN 0958-8248.
- Horne, Malcolm (Summer 1997). Jelliss, George P. (ed.). "Grand Chess: The Yerevan Games". Variant Chess. Vol. 3 no. 24. British Chess Variants Society. pp. 71–72. ISSN 0958-8248.
- Pritchard, D. B. (2007). Beasley, John (ed.). The Classified Encyclopedia of Chess Variants. John Beasley. ISBN 978-0-9555168-0-1.
- Schmittberger, R. Wayne (1992). New Rules for Classic Games. John Wiley & Sons Inc. ISBN 978-0471536215.
- Vehre, John (2003). Handscomb, Kerry (ed.). "The Grand Chess Corner". Abstract Games. No. 13–14. Carpe Diem Publishing. ISSN 1492-0492.
External links
- Official website
- 2001 Cyber World Championship game annotated by John Vehre
- Grand Chess: The Yerevan Games by Malcolm Horne
- Christian Freeling's Grand Chess by Hans Bodlaender, The Chess Variant Pages
- Grand Chess at BoardGameGeek
- Grand Chess a simple program by Ed Friedlander (Java)