Infinite chess

Last updated
A simple infinite chess scheme (starting position). More complex schemes have the addition of various fairy chess pieces as well as the infinitely large board. Infinite chess.png
A simple infinite chess scheme (starting position). More complex schemes have the addition of various fairy chess pieces as well as the infinitely large board.

Infinite chess is any variation of the game of chess played on an unbounded chessboard. Versions of infinite chess have been introduced independently by multiple players, chess theorists, and mathematicians, both as a playable game and as a model for theoretical study. It has been found that even though the board is unbounded, there are ways in which a player can win the game in a finite number of moves.

Contents

Background

Taikyoku shogi (36x36 squares), most likely starting position. The complete rules of this historical game are not conclusively known. TaikyokuShogiSente.svg
Taikyoku shōgi (36×36 squares), most likely starting position. The complete rules of this historical game are not conclusively known.

Classical (FIDE) chess is played on an 8×8 board (64 squares). However, the history of chess includes variants of the game played on boards of various sizes. A predecessor game called courier chess was played on a slightly larger 12×8 board (96 squares) in the 12th century, and continued to be played for at least six hundred years. Japanese chess (shogi) has been played historically on boards of various sizes; the largest is taikyoku shōgi ("ultimate chess"). This chess-like game, which dates to the mid 16th century, was played on a 36×36 board (1296 squares). Each player starts with 402 pieces of 209 different types, and a well-played game would require several days of play, possibly requiring each player to make over a thousand moves. [1] [2] [3] [4]

Chess player Jianying Ji was one of many to propose infinite chess, suggesting a setup with the chess pieces in the same relative positions as in classical chess, with knights replaced by nightriders and a rule preventing pieces from travelling too far from opposing pieces. [5] Numerous other chess players, chess theorists, and mathematicians who study game theory have conceived of variations of infinite chess, often with different objectives in mind. Chess players sometimes use the scheme simply to alter the strategy; since chess pieces, and in particular the king, cannot be trapped in corners on an infinite board, new patterns are required to form a checkmate. Theorists conceive of infinite chess variations to expand the theory of chess in general, or as a model to study other mathematical, economic, or game-playing strategies. [6] [7] [8] [9] [10]

Decidability of short mates

For infinite chess, it has been found that the mate-in-n problem is decidable; that is, given a natural number n and a player to move and the positions (such as on ) of a finite number of chess pieces that are uniformly mobile and with constant and linear freedom, there is an algorithm that will answer if there is a forced checkmate in at most n moves. [11] One such algorithm consists of expressing the instance as a sentence in Presburger arithmetic and using the decision procedure for Presburger arithmetic.

The winning-position problem is not known to be decidable. [11] In addition to the lack of an obvious upper bound on the smallest such n when there is a mate-in-n, there could also be positions for which there is a forced mate but no integer n such that there is a mate-in-n. For example, there could be a position such that after one move by black, the number of moves until black gets checkmated will equal the distance by which black moved whichever piece black moved.

See also

Related Research Articles

<span class="mw-page-title-main">Shogi</span> Game native to Japan

Shogi, also known as Japanese chess, is a strategy board game for two players. It is one of the most popular board games in Japan and is in the same family of games as Western chess, chaturanga, xiangqi, Indian chess, and janggi. Shōgi means general's board game.

<span class="mw-page-title-main">Bughouse chess</span> Chess variant played on two chessboards by four players in teams of two

Bughouse chess is a popular chess variant played on two chessboards by four players in teams of two. Normal chess rules apply, except that captured pieces on one board are passed on to the teammate on the other board, who then has the option of putting these pieces on their board.

<span class="mw-page-title-main">Minishogi</span>

Minishogi is a modern variant of shogi. The game was invented around 1970 by Shigenobu Kusumoto of Osaka, Japan. The rules are nearly identical to those of standard shogi, with the exception that it is played on a 5x5 board with a reduced number of pieces, and each player's promotion zone consists only of the rank farthest from the player.

Combinatorial game theory measures game complexity in several ways:

  1. State-space complexity,
  2. Game tree size,
  3. Decision complexity,
  4. Game-tree complexity,
  5. Computational complexity.
<span class="mw-page-title-main">Crazyhouse</span> Chess variant with drops

Crazyhouse is a chess variant in which captured enemy pieces can be reintroduced, or dropped, into the game as one's own. It was derived as a two-player, single-board variant of bughouse chess.

<span class="mw-page-title-main">Tai shogi</span> 25x25 grid variant of Japanese chess

Tai shogi is a large-board variant of shogi. The game dates to the 15th century and is based on earlier large-board shogi games. Before the discovery of taikyoku shogi in 1997, tai shogi was believed to be the largest playable chess variant, if not board game, ever. One game may be played over several long sessions and require each player to make over a thousand moves. It was never a popular game; indeed, a single production of six game sets in the early 17th century was a notable event.

Yari shogi is a modern variant of shogi ; however, it is not Japanese. It was invented in 1981 by Christian Freeling of the Netherlands. This game accentuates shogi’s intrinsically forward range of direction by giving most of the pieces the ability to move any number of free squares orthogonally forward like a shogi lance. The opposite is true of promoted pieces which can move backward with the same power.

Tsume shogi or tsume (詰め) is the Japanese term for a shogi miniature problem in which the goal is to checkmate the opponent's king. Tsume problems usually present a situation that might occur in a shogi game, and the solver must find out how to achieve checkmate. It is similar to a mate-in-n chess problem.

Dai shogi or Kamakura dai shogi (鎌倉大将棋) is a chess variant native to Japan. It derived from Heian era shogi, and is similar to standard shogi in its rules and game play. Dai shogi is only one of several large board shogi variants. Its name means large shogi, from a time when there were three sizes of shogi games. Early versions of dai shogi can be traced back to the Kamakura period, from about AD 1230. It was the historical basis for the later, much more popular variant chu shogi.

<span class="mw-page-title-main">Dai dai shogi</span>

Dai dai shōgi is a large board variant of shogi. The game dates back to the 15th century and is based on the earlier dai shogi. Apart from its size, the major difference is in the range of the pieces and the "promotion by capture" rule. It is the smallest board variant to use this rule.

<span class="mw-page-title-main">Yonin shogi</span>

Yonin shōgi,, is a four-person variant of shogi. It may be played with a dedicated yonin shogi set or with two sets of standard shogi pieces, and is played on a standard sized shogi board.

Sannin shōgi, or in full kokusai sannin shōgi, is a three-person shogi variant invented circa 1930 by Tanigasaki Jisuke and recently revived. It is played on a hexagonal grid of border length 7 with 127 cells. Standard shogi pieces may be used, and the rules for capture, promotion, drops, etc. are mostly similar to standard shogi. While piece movement differs somewhat from standard shogi, especially in the case of the powerful promoted king, the main difference in play is due to the rules for voluntary and mandatory alliance between two of the three players.

Three-player chess is a family of chess variants specially designed for three players. Many variations of three-player chess have been devised. They usually use a non-standard board, for example, a hexagonal or three-sided board that connects the center cells in a special way. The three armies are differentiated usually by color.

<span class="mw-page-title-main">Zillions of Games</span> General game playing software

Zillions of Games is a commercial general game playing system developed by Jeff Mallett and Mark Lefler in 1998. The game rules are specified with S-expressions, Zillions rule language. It was designed to handle mostly abstract strategy board games or puzzles. After parsing the rules of the game, the system's artificial intelligence can automatically play one or more players. It treats puzzles as solitaire games and its AI can be used to solve them.

Shogi, like western chess, can be divided into the opening, middle game and endgame, each requiring a different strategy. The opening consists of arranging one's defenses and positioning for attack, the middle game consists of attempting to break through the opposing defenses while maintaining one's own, and the endgame starts when one side's defenses have been compromised.

<span class="mw-page-title-main">Dōbutsu shōgi</span> Small shogi variant

Dōbutsu shōgi is a small shogi variant for young children. It was invented by women's professional shogi player Madoka Kitao, partially to attract young girls to the game. It is played on a 3×4 board and generally follows the rules of standard shogi, including drops, except that pieces can only move one square at a time, and the king reaching the enemy camp as an additional way to win the game.

Solving chess consists of finding an optimal strategy for the game of chess; that is, one by which one of the players can always force a victory, or either can force a draw. It is also related to more generally solving chess-like games such as Capablanca chess and infinite chess.

<span class="mw-page-title-main">Outline of chess</span> Overview of and topical guide to chess

The following outline is provided as an overview of and topical guide to chess:

<span class="mw-page-title-main">Joel David Hamkins</span> American mathematician

Joel David Hamkins is an American mathematician and philosopher who is O'Hara Professor of Philosophy and Mathematics at the University of Notre Dame. He has made contributions in mathematical and philosophical logic, set theory and philosophy of set theory, in computability theory, and in group theory.

References

  1. Taikyoku Shogi.
  2. Chess Variants: Taikyoku Shogi.
  3. Abstract Strategy Games.
  4. Free History of Chess.
  5. Infinite Chess at The Chess Variant Pages . An infinite chess scheme represented using ASCII characters.
  6. "Infinite Chess, PBS Infinite Series" PBS Infinite Series.
  7. Evans, C. D. A.; Joel David Hamkins (2013). "Transfinite game values in infinite chess". arXiv: 1302.4377 .{{cite journal}}: Cite journal requires |journal= (help)
  8. Evans, C. D. A.; Joel David Hamkins; Norman Lewis Perlmutter (2015). "A position in infinite chess with game value ω4". arXiv: 1510.08155 .{{cite journal}}: Cite journal requires |journal= (help)
  9. Aviezri Fraenkel; D. Lichtenstein (1981), "Computing a perfect strategy for n×n chess requires time exponential in n", J. Combin. Theory Ser. A, 31 (2): 199–214, doi: 10.1016/0097-3165(81)90016-9
  10. "A position in infinite chess with game value w^4" Transfinite game values in infinite chess, January 2017; A position in infinite chess with game value w^4, October 2015; An introduction to the theory of infinite games, with examples from infinite chess, November 2014; The theory of infinite games: how to play infinite chess and win, August 2014; and other academic papers by Joel Hamkins.
  11. 1 2 Brumleve, Dan; Hamkins, Joel David; Schlicht, Philipp (2012). "The Mate-in-n Problem of Infinite Chess is Decidable". How the World Computes. Lecture Notes in Computer Science. Vol. 7318. Springer. pp. 78–88. arXiv: 1201.5597 . doi:10.1007/978-3-642-30870-3_9. ISBN   978-3-642-30869-7. S2CID   8998263.