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).
Chess is a board game for two players. It is sometimes called international chess or Western chess to distinguish it from related games such as xiangqi and shogi.
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.
Chess strategy is the aspect of chess play concerned with evaluation of chess positions and setting goals and long-term plans for future play. While evaluating a position strategically, a player must take into account such factors as the relative value of the pieces on the board, pawn structure, king safety, position of pieces, and control of key squares and groups of squares. Chess strategy is distinguished from chess tactics, which is the aspect of play concerned with the move-by-move setting up of threats and defenses. Some authors distinguish static strategic imbalances, which tend to persist for many moves, from dynamic imbalances, which are temporary. This distinction affects the immediacy with which a sought-after plan should take effect. Until players reach the skill level of "master", chess tactics tend to ultimately decide the outcomes of games more often than strategy. Many chess coaches thus emphasize the study of tactics as the most efficient way to improve one's results in serious chess play.
A chess problem, also called a chess composition, is a puzzle created by the composer using chess pieces on a chessboard, 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.
This glossary of chess explains commonly used terms in chess, in alphabetical order. Some of these terms have their own pages, like fork and pin. For a list of unorthodox chess pieces, see Fairy chess piece; for a list of terms specific to chess problems, see Glossary of chess problems; for a list of named opening lines, see List of chess openings; for a list of chess-related games, see List of chess variants; for a list of terms general to board games, see Glossary of board games.
A fairy chess piece, variant chess piece, unorthodox chess piece, or heterodox chess piece is a chess piece not used in conventional chess but incorporated into certain chess variants and some unorthodox chess problems, known as fairy chess. Compared to conventional pieces, fairy pieces vary mostly in the way they move, but they may also follow special rules for capturing, promotions, etc. Because of the distributed and uncoordinated nature of unorthodox chess development, the same piece can have different names, and different pieces can have the same name in various contexts.
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.
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.
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.
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.
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.
In chess, promotion is the replacement of a pawn with a new piece when the pawn is moved to its last rank. The player replaces the pawn immediately with a queen, rook, bishop, or knight of the same color. The new piece does not have to be a previously captured piece. Promotion is mandatory when moving to the last rank; the pawn cannot remain as a pawn.
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.
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.
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.
In chess, several checkmate patterns occur frequently enough to have acquired specific names in chess commentary. By definition, a checkmate pattern is a recognizable/particular/studied arrangements of pieces that delivers checkmate. The diagrams that follow show these checkmates with White checkmating Black.
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.
The following outline is provided as an overview of and topical guide to chess:
Chess on a really big board is a large chess variant invented by Ralph Betza around 1996. It is played on a 16×16 chessboard with 16 pieces and 16 pawns per player. Since such a board can be constructed by pushing together four standard 8×8 boards, Betza also gave this variant the alternative names of four-board chess or chess on four boards.
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.
