Corresponding squares

Corresponding squares
Chess x1l45.svg Chess d45.svg Chess l45.svg Chess x1d45.svg

Corresponding squares (also called relative squares, sister squares and coordinate squares (Mednis 1987:11–12)) in chess occur in some chess endgames, usually ones that are mostly blocked. If squares x and y are corresponding squares, it means that if one player moves to x then the other player must move to y in order to hold his position. Usually there are several pairs of these squares, and the members of each pair are labeled with the same number, e.g. 1, 2, etc. In some cases they indicate which square the defending king must move to in order to keep the opposing king away. In other cases, a maneuver by one king puts the other player in a situation where he cannot move to the corresponding square, thus the first king is able to penetrate the position (Müller & Lamprecht 2007:188–203). The theory of corresponding squares is more general than opposition, and is more useful in cluttered positions.

Contents


Details

Corresponding squares are squares of reciprocal (or mutual) zugzwang. They occur most often in king and pawn endgames, especially with triangulation, opposition, and mined squares (see Zugzwang#Mined squares). A square that White can move to corresponds to a square that Black can move to. If one player moves to such a square, the opponent moves to the corresponding square to put the opponent in zugzwang (Dvoretsky 2006:15–20).

Examples

A simple example

Corresponding squares
Solid white.svg a b c d e f g h Solid white.svg
8  black king  black king  one  three  two  black king  black king  black king 8
7  black king  black king  cross  three  cross  black king  black king  black king 7
6  black king  black king  one  white pawn  two  black king  black king  black king 6
5  black king  black king  three  three  three  black king  black king  black king 5
4  black king  black king  black king  black king  black king  black king  black king  black king 4
3  black king  black king  black king  black king  black king  black king  black king  black king 3
2  black king  black king  black king  black king  black king  black king  black king  black king 2
1  black king  black king  black king  black king  black king  black king  black king  black king 1
Solid white.svg a b c d e f g h Solid white.svg
Numbered squares are corresponding squares in king and pawn versus king. Squares marked "x" are key squares.

One of the simplest and most important uses of corresponding squares is in this king and pawn versus king endgame. Assume that the black king is in front of the pawn and the white king is behind or to the side of the pawn. The black king is trying to block the white pawn and the white king is supporting its pawn. If the white king gets to any of the key squares (marked with "x"), he wins. Suppose the black king moves to the square labeled "1" near him (square c8). Then if the white king moves to the corresponding square (also labeled "1", square c6), he wins. Conversely, if the white king moves to the "1" square then the black king must move to the corresponding square to draw. Thus if both kings are on the "1" squares, the position is a reciprocal zugzwang. Note that the second player moving to one of the corresponding squares has the advantage. Being on a square when the opponent is not on the corresponding square is a disadvantage.

The squares labeled "2" are similar corresponding squares. If the white king is on the d5 square (the middle one labeled "3"), he is threatening to move to either the "1" square or the "2" square. Therefore the black king must be in a position to move to either his "1" square or his "2" square in order to hold the draw, so he must be on one of his "3" squares. This makes the defense for Black clear: shift between the squares labeled "3" until the white king moves to his "1" or "2" square, and then go to the corresponding square, gaining the opposition. If the black king moves to the "1" or "2" squares under any other circumstances, the white king moves to the corresponding square, takes the opposition, the black king moves, and White advances the pawn and will promote it and win, with a basic checkmate.

The c5 and e5 squares can also be label "3" squares, since if the white king is on one of them, the black king must be on one of his "3" squares to draw.

A second example

Rösch-Mast 1995
Solid white.svg a b c d e f g h Solid white.svg
8  black king  black king  black king  black king  black king  black king  black king  black king 8
7  black king  black king  black king  black king  black king  black king  black king  black king 7
6  black king  black king  black king  black king  black king  black king  black king  black king 6
5  black king  black king  black king  black king  black king  black pawn  black king  black king 5
4  black king  black king  black king  black king  black king  black king  black king  black king 4
3  black king  black king  black king  one  black king  one  black king  black pawn 3
2  black king  black king  black king  two  white king  two  black king  white pawn 2
1  black king  black king  black king  three  black king  three  black king  black king 1
Solid white.svg a b c d e f g h Solid white.svg
White to move, but drawn with either side to move

This is another example that is fairly simple. The key squares (see king and pawn versus king endgame) are e1, e2, e3, and f3. If the black king gets to any of those squares, Black wins. The job of the white king is to keep the black king off those squares. One might think that Black has the advantage, since he has the opposition. White can defend the two key squares of e3 and f3 by oscillating between e2 and f2. White's defense is simple if he observes the corresponding squares:

1. Kf2! (keeping the black king off e3 and f3)
1... Kd3
2. Kf3! moving to the corresponding square
2... Kd2
3. Kf2! Kd1
4. Kf1!

Each time the black king moves to a numbered square, the white king moves to the corresponding square (Müller & Lamprecht 2007:191).

An example with separated key squares

A study by Nikolay Grigoriev, 1924
Solid white.svg a b c d e f g h Solid white.svg
8  black king  black king  black king  black king  black king  black king  black king  black king 8
7  black king  black king  black king  black king  black king  black king  black king  black king 7
6  black king  black king  black king  black king  black king  black king  black king  black king 6
5  black king  six  two  black king  black king  black king  black king  black king 5
4  black king  one  black king  three  black king  black king  black king  black king 4
3  cross  cross  black pawn  white pawn  four  five  black king  black king 3
2  one  black king  white pawn  black king  cross  cross  black king  black king 2
1  six  two  three  four  white king  black king  black king  black king 1
Solid white.svg a b c d e f g h Solid white.svg
(e1 is a "5" for White) White to move wins, Black to move draws

In this position, the squares marked with "x" are key squares and the e1 square is a "5" for White. If White occupies any of the key squares, he wins. With separated key squares, the shortest path connecting them is significant. If White is to move in this position, he wins by seizing a key square by moving to e2 or f2. If Black is to move, he draws by moving to his "5" square. Black maintains the draw by always moving to the square corresponding to the one occupied by the white king (Müller & Lamprecht 2007:188–89).

An example with triangulation

Study by Grigoriev
Solid white.svg a b c d e f g h Solid white.svg
8  black king  black king  black king  black king  black king  black king  black king  black king 8
7  black king  black king  black king  black king  black king  black king  black king  black king 7
6  black king  black king  black king  black king  black king  black king  black king  black king 6
5  black king  black pawn  black king  black king  black king  black king  black king  black king 5
4  black king  white pawn  black king  cross  black king  three  black king  black king 4
3  black king  one  two  white pawn  two  black king  black king  black king 3
2  black king  one  three  white king  cross  black king  black king  black king 2
1  black king  black king  black king  black king  black king  black king  black king  black king 1
Solid white.svg a b c d e f g h Solid white.svg
The white king is on one of his "1" squares, the black king is on his "1" square. Key squares are e2, e3, and d4, marked with "x" except for e3. The corresponding squares help show White's winning process.

In this position, e2, e3, and d4 are key squares. If the white king can reach any of them, White wins. The black king cannot move out of the "square" of White's d-pawn (see king and pawn versus king endgame), otherwise it will promote. The square c3 is adjacent to d4 and the "1" square the White king is on, so it is numbered "2". Therefore e3 is "2" for Black. White threatens to move to c2, so this is labeled "3". Since Black must be able to move to "1" and "2", f4 is his corresponding "3" square. If the White king is on b2 or b3, he is threatening to move to "2" or to "3", so those are also "1" squares for him. White has more corresponding squares, so he can out-maneuver Black to win (Müller & Lamprecht 2007:189).

1. Kc2 Kf4
2. Kb3 Kf3
3. Kb2 Kf4 The black king must leave his "1" square, and has no corresponding "1" square to which to move.
4. Kc2! Kf3 The white king moved to his "3" square but the black king is on his "3" square, so he cannot move to "3". White has used triangulation.
5. Kd2 Back to the starting position, but with Black to move.
5... Kf4 Black is on his "1" square, so cannot move to a "1" square.
6. Ke2!

White occupies a key square and can support the advance of his pawn until he is able to win the black pawn, e.g.: 6... Kf5 7. Ke3 Ke5 8. d4+ Kd5 9. Kd3 Kd6 10. Ke4 Ke6 11. d5+ Kd6 12. Kd4 Kd7 13. Kc5.

Lasker-Reichhelm position

Lasker & Reichhelm, 1901
Solid white.svg a b c d e f g h Solid white.svg
8  black king  five  four  black king  black king  black king  black king  black king 8
7  black king  three  two  black king  black king  black king  black king  black king 7
6  black king  one  black king  black pawn  black king  black king  six  black king 6
5  black pawn  cross  black king  white pawn  black king  black pawn  cross  cross 5
4  white pawn  black king  one  white pawn  black king  white pawn  black king  six 4
3  black king  black king  three  two  black king  black king  black king  black king 3
2  black king  black king  five  four  black king  black king  black king  black king 2
1  white king  black king  three  two  black king  black king  black king  black king 1
Solid white.svg a b c d e f g h Solid white.svg
White to move wins, Black to move draws. "X" indicates key squares, some of the corresponding squares are marked

One of the most famous and complicated positions solved with the method of corresponding squares is this endgame study composed by World Champion Emanuel Lasker and Gustavus Charles Reichhelm in 1901. It is described in the 1932 treatise L'opposition et cases conjuguées sont réconciliées (Opposition and Sister Squares are Reconciled), by Vitaly Halberstadt and Marcel Duchamp.

1. Kb1 Kb7
2. Kc1 Kc7
3. Kd1 Kd8
4. Kc2 Kc8
5. Kd2 Kd7
6. Kc3 Kc7
7. Kd3 Kb6
8. Ke3

and White wins by penetrating on the kingside. Each of White's first seven moves are the only one that wins (Müller & Lamprecht 2007:193–94).

See also

References

  • Dvoretsky, Mark (2006), Dvoretsky's Endgame Manual (second ed.), Russell Enterprises, ISBN 1-888690-28-3 
  • Mednis, Edmar (1987), Questions and Answers on Practical Endgame Play, Chess Enterprises, ISBN 0-931462-69-X 

Wikimedia Foundation. 2010.

Игры ⚽ Поможем сделать НИР

Look at other dictionaries:

  • Ordinary least squares — This article is about the statistical properties of unweighted linear regression analysis. For more general regression analysis, see regression analysis. For linear regression on a single variable, see simple linear regression. For the… …   Wikipedia

  • Lack-of-fit sum of squares — In statistics, a sum of squares due to lack of fit, or more tersely a lack of fit sum of squares, is one of the components of a partition of the sum of squares in an analysis of variance, used in the numerator in an F test of the null hypothesis… …   Wikipedia

  • Small Latin squares and quasigroups — Below the Latin squares and quasigroups of some small orders are considered.ize/order 1For size 1 there is 1 Latin square with symbol a and 1 quasigroup with underlying set {a}; it is a group, the trivial group.ize/order 2For size 2 there are 2… …   Wikipedia

  • Strachey method for magic squares — The Strachey method for magic squares is an algorithm for generating magic squares of singly even order 4 n +2.Example of magic square of order 6 constructed with the Strachey method: example 35 1 6 26 19 24 3 32 7 21 23 25 31 9 2 22 27 20 8 28… …   Wikipedia

  • Linear least squares (mathematics) — This article is about the mathematics that underlie curve fitting using linear least squares. For statistical regression analysis using least squares, see linear regression. For linear regression on a single variable, see simple linear regression …   Wikipedia

  • Hollywood Squares — Infobox Television show name = Hollywood Squares caption = The Hollywood Squares title screen (1966 1981) genre = Comedy/Quiz creator = Merrill Heatter and Bob Quigley developer = presenter = Peter Marshall (1966 1981) Jon Bauman (1983 1984) John …   Wikipedia

  • Total least squares — The bivariate (Deming regression) case of Total Least Squares. The red lines show the error in both x and y. This is different from the traditional least squares method which measures error parallel to the y axis. The case shown, with deviations… …   Wikipedia

  • Least-squares spectral analysis — (LSSA) is a method of estimating a frequency spectrum, based on a least squares fit of sinusoids to data samples, similar to Fourier analysis. [cite book | title = Variable Stars As Essential Astrophysical Tools | author = Cafer Ibanoglu |… …   Wikipedia

  • Least-squares estimation of linear regression coefficients — In parametric statistics, the least squares estimator is often used to estimate the coefficients of a linear regression. The least squares estimator optimizes a certain criterion (namely it minimizes the sum of the square of the residuals). In… …   Wikipedia

  • Least squares inference in phylogeny — generates a phylogenetic tree based on anobserved matrix of pairwise genetic distances andoptionally a weightmatrix. The goal is to find a tree which satisfies the distance constraints asbest as possible.Ordinary and weighted least squaresThe… …   Wikipedia

Share the article and excerpts

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