Chess puzzle

From Wikipedia, the free encyclopedia
  (Redirected from Chess puzzles)
Jump to: navigation, search

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.

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[edit]

While a chess puzzle is any puzzle involving aspects of chess, a chess problem is an orthodox puzzle in which one must play and win or draw a game, starting with a certain composition of pieces on the chess board, and playing within the standard rules of chess.

Orthodox chess problems 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[edit]

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 of 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[edit]

Main article: Mathematical chess problem

Some chess problems, like the Eight queens puzzle or the Knight's Tour, 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[edit]

References[edit]

External links[edit]