Chess puzzle

Last updated

A chess puzzle is a puzzle in which knowledge of the pieces and rules of chess is used to solve logically a chess-related problem. The history of chess puzzles reaches back to the Middle Ages and has evolved since then.

Contents

Usually the goal is to find the single best, ideally aesthetic move or a series of single best moves in a chess position, which was created by a composer or is from a real game. But puzzles can also set different objectives. Examples include deducing the last move played, the location of a missing piece, or whether a player has lost the right to castle. Sometimes the objective is antithetical to normal chess, such as helping (or even compelling) the opponent to checkmate one's own king.

Chess problems

While a chess puzzle is any puzzle involving aspects of chess, a chess problem is an arranged position with a specific task to be fulfilled, such as White mates in n moves. Chess problems are also known as chess compositions because the positions are specially devised, rather than arising from actual games. Chess problems are divided into orthodox and heterodox types, both covering a variety of genres.

Orthodox chess problems employ the standard rules of chess and involve positions that can arise from actual game play (although the process of getting to that position may be unrealistic). The most common orthodox chess puzzle takes the form of checkmate in n moves. The puzzle positions are seldom similar to positions from actual play, and the challenge is not to find a winning move, but rather to find the (usually unique) move which forces checkmate as rapidly as possible.

Heterodox chess problems involve conditions that are impossible with normal play, such as multiple kings or chess variants, while fairy chess problems employ pieces not used in orthodox chess, such as the amazon (a piece combining the powers of the queen and the knight).

Tactical puzzles

Chess puzzles can also be regular positions from a game (with normal rules), usually meant as training positions, tactical or positional, from all phases of the game (openings, middlegame and endings). These are known as tactical puzzles. They can range from a simple "Mate in one" combination to a complex attack on the opponent's king. Solving tactical chess puzzles is a very common chess teaching technique. Although it is unlikely that the same position will occur in a game the student plays, the recognition of certain patterns can help to find a good move or plan in another position.

Mathematical chess problems

Some chess problems, like the eight queens puzzle or the knight's tour problem, have connections to mathematics, especially to graph theory and combinatorics. Many famous mathematicians have studied such problems, including Euler, Legendre, and Gauss. Besides finding a solution to a particular puzzle, mathematicians are usually interested in counting the total number of possible solutions, finding solutions with certain properties, and generalization of the problems to n×n or rectangular boards.

See also

Related Research Articles

<span class="mw-page-title-main">Chess</span> Strategy board game

Chess is a board game for two players, called White and Black, each controlling an army of chess pieces, with the objective to checkmate the opponent's king. It is sometimes called international chess or Western chess to distinguish it from related games such as xiangqi and shogi. The recorded history of chess goes back at least to the emergence of a similar game, chaturanga, in seventh century India. The rules of chess as they are known today emerged in Europe at the end of the 15th century, with standardization and universal acceptance by the end of the 19th century. Today, chess is one of the world's most popular games played by millions of people worldwide.

The eight queens puzzle is the problem of placing eight chess queens on an 8×8 chessboard so that no two queens threaten each other; thus, a solution requires that no two queens share the same row, column, or diagonal. There are 92 solutions. The problem was first posed in the mid-19th century. In the modern era, it is often used as an example problem for various computer programming techniques.

<span class="mw-page-title-main">Chess problem</span> A chess composition whose solution is a mate or other clear objective

A chess problem, also called a chess composition, is a puzzle set by the composer using chess pieces on a chess board, which presents the solver with a particular task. For instance, a position may be given with the instruction that White is to move first, and checkmate Black in two moves against any possible defence. A chess problem fundamentally differs from over-the-board play in that the latter involves a struggle between Black and White, whereas the former involves a competition between the composer and the solver. Most positions which occur in a chess problem are 'unrealistic' in the sense that they are very unlikely to occur in over-the-board play. There is a good deal of specialized jargon used in connection with chess problems.

Losing chess is one of the most popular chess variants. The objective of each player is to lose all of their pieces or be stalemated, that is, a misère version. In some variations, a player may also win by checkmating or by being checkmated.

This glossary of chess problems explains commonly used terms in chess problems, in alphabetical order. For a list of unorthodox pieces used in chess problems, see Fairy chess piece; for a list of terms used in chess is general, see Glossary of chess; for a list of chess-related games, see List of chess variants.

<span class="mw-page-title-main">Grid chess</span> Chess variant where every move must cross a grid line.

Grid chess is a chess variant invented by Walter Stead in 1953. It is played on a grid board. This is a normal 64-square chessboard with a grid of lines further dividing it into larger squares. A single additional rule governs Grid chess: for a move to be legal, the piece moved must cross at least one grid line.

Progressive chess is a chess variant in which players, rather than just making one move per turn, play progressively longer series of moves. The game starts with White making one move, then Black makes two consecutive moves, White replies with three, Black makes four and so on. Progressive chess can be combined with other variants; for example, when Circe chess is played as a game, it is usually progressively. Progressive chess is considered particularly apt for playing correspondence chess using mail or some other slow medium, because of the relatively small number of moves in a typical game.

A helpmate is a type of chess problem in which both sides cooperate in order to achieve the goal of checkmating Black. In a helpmate in n moves, Black moves first, then White, each side moving n times, to culminate in White's nth move checkmating Black. Although the two sides cooperate, all moves must be legal according to the rules of chess.

<span class="mw-page-title-main">V. R. Parton</span> English chess variant inventor (1897–1974)

Vernon Rylands Parton was an English chess enthusiast and prolific chess variant inventor, his most renowned variants being Alice chess and Racing Kings. Many of Parton's variants were inspired by the fictional characters and stories in the works of Lewis Carroll. Parton's formal education background, like Lewis Carroll's, was in mathematics. Parton's interests were wide and he was a great believer in Esperanto.

<span class="mw-page-title-main">Cylinder chess</span> Chess variant

Cylinder chess is a chess variant. The game is played as if the board were a cylinder, with the left side of the board joined to the right side. Cylinder chess is one of six chess variants described by the Arabic historian Ali al-Masudi in 947.

Checkless chess, also known as prohibition chess, is a chess variant where neither player may give check unless it is checkmate. All other rules are as in regular chess. The origin of the game is unknown, dating from the mid-19th century. The variant is a popular problem theme, usually requiring a fairy mate.

<span class="mw-page-title-main">Hexagonal chess</span> Set of chess variants played on a board with hexagonal cells

Hexagonal chess is a group of chess variants played on boards composed of hexagon cells. The best known is Gliński's variant, played on a symmetric 91-cell hexagonal board.

A joke chess problem is a puzzle in chess that uses humor as a primary or secondary element. Although most chess problems, like other creative forms, are appreciated for serious artistic themes, joke chess problems are enjoyed for some twist. In some cases the composer plays a trick to prevent a solver from succeeding with typical analysis. In other cases, the humor derives from an unusual final position. Unlike in ordinary chess puzzles, joke problems can involve a solution which violates the inner logic or rules of the game.

This article covers computer software designed to solve, or assist people in creating or solving, chess problems – puzzles in which pieces are laid out as in a game of chess, and may at times be based upon real games of chess that have been played and recorded, but whose aim is to challenge the problemist to find a solution to the posed situation, within the rules of chess, rather than to play games of chess from the beginning against an opponent.

<span class="mw-page-title-main">Minichess</span> Family of chess variants played on a smaller board

Minichess is a family of chess variants played with regular chess pieces and standard rules, but on a smaller board. The motivation for these variants is to make the game simpler and shorter than standard chess. The first chess-like game implemented on a computer was the 6×6 chess variant Los Alamos chess. The low memory capacity of early computers meant that a reduced board size and a smaller number of pieces were required for the game to be implementable on a computer.

<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.

A mathematical chess problem is a mathematical problem which is formulated using a chessboard and chess pieces. These problems belong to recreational mathematics. The most well-known problems of this kind are the eight queens puzzle and the knight's tour problem, which have connection to graph theory and combinatorics. Many famous mathematicians studied mathematical chess problems, such as, Thabit, Euler, Legendre and Gauss. Besides finding a solution to a particular problem, mathematicians are usually interested in counting the total number of possible solutions, finding solutions with certain properties, as well as generalization of the problems to N×N or M×N boards.

<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">Infinite chess</span> Variation of chess

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.

References