Selfmate

Last updated

A selfmate is a chess problem in which White, moving first, must force the unwilling Black to deliver checkmate within a specified number of moves. Selfmates were once known as sui-mates.

Contents

Example

The problem shown is a relatively simple example. It is a selfmate in two by Wolfgang Pauly [1] [2] from The Theory of Pawn Promotion, 1912: White moves first and compels Black to deliver checkmate on or before Black's second move.

Wolfgang Pauly, 1912
abcdefgh
8
Chessboard480.svg
Chess klt45.svg
Chess blt45.svg
Chess nlt45.svg
Chess plt45.svg
Chess plt45.svg
Chess pdt45.svg
Chess plt45.svg
Chess plt45.svg
Chess kdt45.svg
Chess plt45.svg
Chess pdt45.svg
Chess plt45.svg
Chess blt45.svg
Chess bdt45.svg
8
77
66
55
44
33
22
11
abcdefgh
Selfmate in two

If White can leave Black with no option but to play Bxg2#, the problem is solved.

The only move by which White can force Black to deliver checkmate on or before move two is 1.c8=N. There are two variations:

Note that only a promotion to a knight works on move one: any other piece would be able to interpose after 1...Bxg2+.

Record problems

Karlheinz Bachmann (version by Christopher Jeremy Morse), 2006
abcdefgh
8
Chessboard480.svg
Chess klt45.svg
Chess ndt45.svg
Chess pdt45.svg
Chess pdt45.svg
Chess plt45.svg
Chess ndt45.svg
Chess blt45.svg
Chess qlt45.svg
Chess pdt45.svg
Chess plt45.svg
Chess pdt45.svg
Chess plt45.svg
Chess pdt45.svg
Chess pdt45.svg
Chess bdt45.svg
Chess pdt45.svg
Chess rdt45.svg
Chess rdt45.svg
Chess kdt45.svg
Chess bdt45.svg
8
77
66
55
44
33
22
11
abcdefgh
White to play, selfmate in 203

The current record for the longest selfmate problem is a selfmate in 203, composed by Karlheinz Bachmann and Christopher Jeremy Morse in 2006. [3] The puzzle is based on a 1922 342-move composition by Ottó Titusz Bláthy, which was later found to be cooked.[ citation needed ]

Prior to December 2021, the record for the longest selfmate problem was a 359-move problem, created by Andriy Stetsenko in 2016. [4] Unfortunately, this problem was later found to be cooked, as a shorter solution exists.

Variations

A derivative of the selfmate is the reflexmate , in which White compels Black to give mate with the added condition that if either player can give mate, they must (when this condition applies only to Black, it is a semi-reflexmate). There is also the maximummer, in which Black must always make the geometrically longest move available, as measured from square-centre to square-centre; although this condition is sometimes found in other types of problems, it is most common in selfmates. Another variation is the series-selfmate, a type of seriesmover in which White makes a series of moves without reply, at the end of which Black makes one move and is compelled to give mate.

See also

Related Research Articles

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

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 Babson task is a directmate chess problem with the following properties:

  1. White has only one key, or first move, that forces checkmate in the stipulated number of moves.
  2. Black's defences include the promotion of a certain pawn to a queen, rook, bishop, or knight.
  3. If Black promotes, then the only way for White towards a forced checkmate in the stipulated number of moves is to promote a pawn to the same piece to which Black promoted.

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.

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.

The Novotny is a device found in chess problems named after a problem from 1854 by Antonín Novotný, though the first example was composed by Henry Turton in 1851. A piece is sacrificed on a square where it could be taken by two different opposing pieces, but whichever makes the capture, it interferes with the other. It is essentially a Grimshaw brought about by a sacrifice on the critical square.

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">Checkmate</span> Winning game position in chess

Checkmate is any game position in chess and other chess-like games in which a player's king is in check and there is no possible escape. Checkmating the opponent wins the game.

In chess, the fool's mate is the checkmate delivered after the fewest possible moves from the game's starting position. It arises from the following moves, or similar:

In chess problems, retrograde analysis is a technique employed to determine which moves were played leading up to a given position. While this technique is rarely needed for solving ordinary chess problems, there is a whole subgenre of chess problems in which it is an important part; such problems are known as retros.

<i>En passant</i> Special pawn move in chess

In chess, en passant describes the capture by a pawn of an enemy pawn on the same rank and an adjacent file that has just made an initial two-square advance. The capturing pawn moves to the square that the enemy pawn passed over, as if the enemy pawn had advanced only one square. The rule ensures that a pawn cannot use its two-square move to safely skip past an enemy pawn.

<span class="mw-page-title-main">Boden's Mate</span> Checkmate pattern

Boden's Mate is a checkmating pattern in chess characterized by bishops on two criss-crossing diagonals, with possible flight squares for the king being occupied by friendly pieces or under attack by enemy pieces. Most often the checkmated king has castled queenside, and is mated on c8 or c1. Many variants on the mate are seen, for example a king on e8 checkmated by bishops on g6 and a3, and a king on f1 checkmated by bishops on h3 and b6. Often the mate is immediately preceded by a sacrifice that opens up the diagonal on which the bishop delivers checkmate, and the mate is often a pure mate.

In chess, a cross-check is a tactic in which a check is played in response to a check, especially when the original check is blocked by a piece that itself either delivers check or reveals a discovered check from another piece. Sometimes the term is extended to cover cases in which the king moves out of check and reveals a discovered check from another piece ; it does not generally apply to cases where the original checking piece is captured.

In chess, a pure mate is a checkmate position such that the mated king is attacked exactly once, and prevented from moving to any of the adjacent squares in its field for exactly one reason per square. Each of the squares in the mated king's field is attacked or "guarded" by one—and only one—attacking unit, or else a square which is not attacked is occupied by a friendly unit, a unit of the same color as the mated king. Some authors allow that special situations involving double check or pins may also be considered as pure mate.

The bishop and knight checkmate in chess is the checkmate of a lone king by a king, a bishop, and a knight. With the stronger side to move and with perfect play, checkmate can be forced in at most thirty-three moves from any starting position where the defender cannot quickly win one of the pieces. The exception is the "stalemate trap". These exceptions constitute about 0.5% of the positions. Checkmates are possible with the defending king on any square at the edge of the board but can be forced only from positions with different material or if the defending king is in a corner controlled by the bishop or on a square on the edge next to a corner; however, mate adjacent to the corners not controlled by the bishop is only two moves deep, so it is not generally encountered unless the defending side plays inaccurately. Although this is classified as one of the four basic or elementary checkmates, it occurs in practice only approximately once in every 6,000 games.

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.

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. Checks cannot be given except on the last move of the series. There are various types of seriesmover:

<span class="mw-page-title-main">Checkmate pattern</span> Chess patterns

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.

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

References

  1. Pauly selfmate
  2. "W. Pauly". Archived from the original on 2012-03-02. Retrieved 2010-01-03.
  3. Morse, Christopher Jeremy (July 2006). "NINTH UPDATE OF CHESS PROBLEMS: TASKS AND RECORDS". The Problemist. 20 (480): 431.
  4. "Award in Jubilee Tourney" (PDF). SuperProblem. Retrieved 12 August 2021.

Further reading