Search results
Results from the WOW.Com Content Network
A type of problem in which there are two solutions, the second one reversing the roles of the colours in the first. The most common type is the duplex helpmate, in which the two solutions are: Black moves first and cooperates with White to be mated; and White moves first and cooperates with Black to be mated.
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 defen
A seriesmover is a chess problem in which one side makes a series of legal moves without reply at the end of which the other side makes a single move, giving checkmate or yielding stalemate, depending on the precise stipulation. [1] Checks cannot be given except on the last move of the series. There are various types of seriesmover:
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 ...
So a problem with set play and three tries, for example, is a five-phase problem (since the actual solution is also a phase). Each phase may contain a number of variations (lines arising from alternatives after the initial move of a phase; in a two-mover, for example, variations in the post-key play begin on Black's first move), but variations ...
(In a helpmate in 2 for example, sometimes abbreviated h#2, the solution consists of a Black move, a White move, a second Black move, then a second White move, giving checkmate.) Although the two sides cooperate, all moves must be legal according to the rules of chess. The example problem illustrated is a helpmate in 8 (or h#8) by Z. Maslar ...
The majority of SPGs have a solution from about six to about thirty moves, although examples with unique solutions more than fifty moves long have been devised. A number of chess problem composers have specialised in SPGs, with one of the most notable examples being Michel Caillaud who did much to popularise the genre in the 1970s and 1980s.
The problem to the left by W. Langstaff (from Chess Amateur 1922) is a relatively simple example; it is a mate in two. It is impossible to determine what move Black played last, but it is clear that he must have either moved the king or rook, or else played g7–g5 (g6–g5 is impossible, since the pawn would have been giving check).