Seriesmover

Seriesmover

Chess diagram|=
tright
Thomas Rayner Dawson
"Fairy Chess Review", 1947
=

8 | | | | | | | | |= 7 | | | | | | | | |= 6 | | | | | | | | |= 5 |nl| | | | | | | |= 4 | | | | | | | | |= 3 | | | | | | | | |= 2 | | | | | |pd| | |= 1 |kd| |kl| | | | | |= a b c d e f g h


Serieshelpmate in 17 moves.

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:

*Seriesmate: a directmate with white playing a series of moves without reply to checkmate black (the seriesmover analogue to the directmate).
*Serieshelpmate: a helpmate in which black plays a series of moves without reply after which white plays one move to checkmate black (the seriesmover analogue to the helpmate).
*Seriesselfmate: a selfmate in which white plays a series of moves leading to a position in which black is forced to give mate (the seriesmover analogue to the selfmate).
*Seriesreflexmate: a reflexmate in which white plays a series of moves leading to a position in which black can, and therefore must, give mate. Further, white is obliged to mate whenever he can, therefore he has to avoid in his series of moves aposition in which he would have mating possibility (the seriesmover analogue to the reflexmate).

Thus a serieshelpmate in "n" moves consists of "n" legal unique moves by black (all but possibly the last non-checking moves) followed by one move by white that mates black. To the right is a serieshelpmate in seventeen by Thomas Rayner Dawson (published in "Fairy Chess Review", 1947). An effective way to solve long serieshelpmates such as this is to envisage a position in which black "could" be checkmated, and then to work out how such a problem could be reached. Here, with just one knight, the only way to checkmate black is to have the black king in the corner and another black piece on a2, allowing Nb3 giving mate. It might seem there are many ways to do this, but the need to avoid exposing the white king to check means that there is only one, involving the black king walking half-way over the board and then back again. (As usual, chess problems with unintended multiple solutions are considered flawed; they are often said to be "cooked".) The solution here is:

:1.Ka2 2.Ka3 3.Kb4 4.Kc3 5.Kd3 6.Ke2 7.Ke1 8.f1R 9.Rf2 10.Ke2 11.Kd3 12.Kc3 13.Kb4 14.Ka3 15.Ka2 16.Ka1 17.Ra2 Nb3#


Wikimedia Foundation. 2010.

Игры ⚽ Нужен реферат?

Look at other dictionaries:

  • Chess problem — Part of a series on Puzzles …   Wikipedia

  • Chess problem terminology — This is a list of terms used in chess problems. 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 chess terminology. NOTOC A *Actual play see post key play . *Albino a …   Wikipedia

  • Fairy chess — is a term in a chess problem which expands classical (also called orthodox) chess problems which are not direct mates. The term was introduced before the First World War. While selfmate dates from the Middle Age, helpmate was invented by Max… …   Wikipedia

  • Helpmate — Chess diagram|= tright Z. Maslar Die Schwalbe , 1981 = 8 | | | | | | | | |= 7 | | | | | | | | |= 6 |nl| | | | | | | |= 5 | | | | | | | | |= 4 | | | | | | | | |= 3 | | | | | | |qd| |= 2 | | | |kl| | |kd| |= 1 | | | |bd| | | | |= a b c d e f g h… …   Wikipedia

  • Shortest proof game — A shortest proof game is a type of retrograde analysis chess problems. The solver must construct a game (so called proof game ), starting from the initial chess position, which ends with a given position (thus proving that that position is… …   Wikipedia

  • Selfmate — A selfmate is a chess problem in which white, moving first, must force black to deliver checkmate within a specified number of moves against his will. Selfmates were once known as sui mates.Chess diagram|= tright Wolfgang Pauly, 1912 = 8 |kl|bl|… …   Wikipedia

  • Excelsior (chess problem) — Chess diagram|= tright Sam Loyd, London Era , 1861 = 8 |nd| |rd|bd| | | | |= 7 | |pd| | | |pd| |pd|= 6 | |pd| | | | | | |= 5 | |rl| | | | | |kl|= 4 | | | | | | | | |= 3 |pd| | | |pd| |pl|nl|= 2 | |pl|pl| |rl| | | |= 1 |nl| | | | | | |kd|= a b c d …   Wikipedia

  • Index of chess articles — Contents 1 Books 2 General articles 2.1 0–9 2.2 A …   Wikipedia

  • Glossary of chess problems — This is a list of terms used in chess problems. 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 chess terminology. Contents: Top · 0–9 · A B C D E F G H I… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”