Documente Academic
Documente Profesional
Documente Cultură
A pawnless chess endgame is a chess endgame in which only a few pieces remain and none of them is a pawn. The basic
checkmates are types of pawnless endgames. Endgames without pawns do not occur very often in practice except for the basic
checkmates of king and queen versus king, king and rook versus king, and queen versus rook (Hooper 1970:4). Other cases that
occur occasionally are (1) a rook and minor piece versus a rook and (2) a rook versus a minor piece, especially if the minor piece
is a bishop (Nunn 2007:156–65).
The study of some pawnless endgames goes back centuries by players such as François-André Danican Philidor (1726–1795) and
Domenico Lorenzo Ponziani (1719–1796). On the other hand, many of the details and recent results are due to the construction of
endgame tablebases. Grandmaster John Nunn wrote a book (Secrets of Pawnless Endings) summarizing the research of endgame
tablebases for several types of pawnless endings.
The assessment of endgame positions assumes optimal play by both sides. In some cases, one side of these endgames can force a
win; in other cases, the game is a draw (i.e. a book draw).
Contents
Terminology
Basic checkmates
Queen versus rook
Example from game
Browne versus BELLE
Queen versus two minor pieces
Common pawnless endings (rook and minor pieces)
Miscellaneous pawnless endings
Queens only
Major pieces only
Queens and rooks with minor pieces
Queens and minor pieces
Examples from games
Example from a study
Rooks and minor pieces
Minor pieces only
Example from game
Terminology
Major pieces are queens and rooks. Minor pieces are knights and bishops.
A rank is a row of squares on the chessboard. A file is a column of squares on the board.
If a player has two bishops, they are assumed to be on opposite colors unless stated otherwise.
When the number of moves to win is specified, optimal play by both sides is assumed. The number of moves given to win is until
either checkmate or the position is converted to a simpler position that is known to be a win. For example, with a queen versus a
rook, that would be until either checkmate or the rook is captured, resulting in a position that leads to an elementary checkmate.
Basic checkmates
Checkmate can be forced against a lone king with a king plus (1) a queen, (2) a rook, (3) two bishops, or (4) a bishop and a knight
(see Bishop and knight checkmate). See Checkmate for more details. Checkmate is possible with two knights, but it cannot be
forced. (See Two knights endgame.)
king and queen, but forced checkmates with the rook still on the board are 6 6
possible in some positions or against incorrect defense. With perfect play, in
5 5
the worst winning position, the queen can win the rook or checkmate within
4 4
31 moves (Müller & Lamprecht 2001:400).
3 3
The "third rank defense" by the rook is difficult for a human to crack. The
2 2
"third rank defense" is when the rook is on the third rank or file from the
1 1
edge of the board, his king is closer to the edge and the enemy king is on the
a b c d e f g h
other side (see the diagram). For example, the winning move in the position
shown is the counterintuitive withdrawal of the queen from the seventh rank Black is employing the third rank
defense. White can win this position in as
to a more central location, 1. Qf4, so the queen can make checking
few as 19 moves with correct play.
maneuvers to win the rook with a fork if it moves along the third rank. If the
black king emerges from the back rank, 1... Kd7, then 2. Qa4+ Kc7; 3.
Qa7+ forces Black into a second-rank defense (defending king on an edge of the board and the rook on the adjacent rank or file)
after 3... Rb7. This position is a standard win, with White heading for the Philidor position with a queen versus rook (Müller &
Lamprecht 2001:331–33). In 1895 Edward Freeborough edited an entire 130-page book of analysis of this endgame, The Chess
Ending, King & Queen against King & Rook. A possible continuation: 4. Qc5+ Kb8 5. Kd6 Rg7 6. Qe5 Rc7 7. Qf4 Kc8 8. Qf5+
Kb8 9. Qe5 Rb7 10. Kc6+ Ka8 11. Qd5 Kb8 12. Qa5 [Philidor—mate in 7].
5 5
3 3
Browne vs. BELLE, game 1
a b c d e f g h 2 2
8 8 1 1
7 7 a b c d e f g h
6 6 Black can win this position in as few as
5 5 13 moves with optimal play from both
4 4
sides.
3 3
2 2 Queen versus rook was one of the
Browne vs. BELLE, game 2
1 1 first endgames completely solved
a b c d e f g h
a b c d e f g h by computers constructing an
8 8
White can win but it ended in a endgame tablebase. A challenge
7 7
draw was issued to Grandmaster Walter
6 6
Browne in 1978 where Browne
5 5
would have the queen in a difficult
4 4
position, defended by BELLE using
3 3
the queen versus rook tablebase.
2 2 Browne could have won the rook or
1 1 checkmated in 31 moves with
a b c d e f g h perfect play. After 45 moves,
White won Browne realized that he would not
be able to win within 50 moves,
according to the fifty-move rule.[4]
Browne studied the position, and later in the month played another match, from a different starting position. This time he won by
capturing the rook on the 50th move (Nunn 2002a:49).[5]
Rook versus a bishop: this is usually a draw. The main exception is when the defending king is trapped in a
corner that is of the same color square as his bishop (Nunn 2002a:31) (see Wrong bishop#Rook versus bishop).
If the defending king is trapped in a corner that is the opposite color as his bishop, he draws (see Fortress
(chess)#Fortress in a corner). See the game of Veselin Topalov versus Judit Polgar, where Topalov defended
and drew the game to clinch a win of their 2008 Dos Hermanas match.[7]
Rook versus a knight: this is usually a draw. There are two main exceptions: the knight is separated from the king
and may be trapped and won or the king and knight are poorly placed (Nunn 2002a:9).[8] Kamsky vs Bacrot,
2006 is an example of a rook vs knight ending which resulted in a win. In this game, Black underpromoted a
pawn to a knight to avoid a checkmate and eventually lost the game after allowing his knight to be separated
from the king.[9]
Rook and a bishop versus a rook: this is one of the most common pawnless endgames and is usually a
theoretical draw. However, the rook and bishop have good winning chances in practice because the defence is
difficult. There are some winning positions such as the Philidor position, which occurs relatively often. There are
two main defensive methods: the Cochrane Defense and the "second rank defense" (Nunn 2007:161–65).
Forced wins require up to 59 moves. As a result, FIDE extended the fifty-move rule to 100 moves and then to 75
moves for this endgame, before returning to fifty moves (Speelman, Tisdall & Wade 1993:382). See rook and
bishop versus rook endgame for more information.
Rook and a knight versus a rook: This is usually a simple draw with few winning positions. The winning positions
require the defending king to be badly placed near a corner; this can not be forced in general (Nunn 2007:159–
61). The Cochrane Defense can be used.[10]
La Bourdonnais vs. McDonnell, Topalov vs. J. Polgar, 2008[11]
1834 a b c d e f g h
a b c d e f g h 8 8
8 8
7 7
7 7
6 6
6 6
5 5
5 5
4 4
4 4
3 3
3 3
2 2
2 2
1 1
1 1 a b c d e f g h
a b c d e f g h White to move, draw
Position after 92...Ka5, draw
Philidor, 1749
a b c d e f g h
8 8
7 7
6 6
5 5
4 4
3 3
2 2
1 1
a b c d e f g h
White to move wins, Black to move draws
(Nunn 2002a:178)
Timman vs. Lutz, 1995[12] J. Polgar vs. Kasparov, 1996[13]
a b c d e f g h a b c d e f g h
8 8 8 8
7 7 7 7
6 6 6 6
5 5 5 5
4 4 4 4
3 3 3 3
2 2 2 2
1 1 1 1
a b c d e f g h a b c d e f g h
Black to move, drawn 52 moves later Position before White's 70th move, a
(Lutz 1999:129–31) draw with correct play. Polgar blundered
on move 79 and resigned after move 90.
7 7 7 7
6 6 6 6
5 5 5 5
4 4 4 4
3 3 3 3
2 2 2 2
1 1 1 1
a b c d e f g h a b c d e f g h
White to move, the game was drawn Black to move. This combination is
twelve moves later. The white king usually a draw but here White wins
cannot be driven to the edge. because the black king and knight are far
apart (Müller & Pajeken 2008:237),
(Károlyi & Aplin 2007:320–22), (Nunn
2007:158–59).
The fifty-move rule is not taken into account, and it would often be applicable in practice. When one side has two bishops, they
are assumed to be on opposite colored squares, unless otherwise stated. When each side has one bishop, the result often depends
on whether or not the bishops are on the same color, so their colors will always be stated.
Queens only
Queen versus queen: usually a draw, but the side to move first Comte vs. Le Roy, France, 1997
wins in 41.75% of the positions (Müller & Lamprecht 2001:400).
a b c d e f g h
There are some wins when one queen is in the corner, e.g. as a
result of promoting a rook pawn or bishop pawn (Hooper 8 8
1970:17–19).
7 7
Two queens versus one queen: Almost always a win. A cross-
check may be necessary, see cross-check#Two queens versus 6 6
one for an example (Müller & Lamprecht 2001:400). A draw is
possible in a few exceptional positions if the weaker side has an 5 5
immediate perpetual check, e.g. with a white king on a1 and
white queens on a2 and b1, the black king on e8, and the black 4 4
queen giving check on d4. Black has as an unlimited supply of 3 3
checks on d4, a4, and d1, and the white king cannot escape the
corner. 2 2
Two queens versus two queens: The first to move wins in 83% of
1 1
the positions (see the Comte vs. Le Roy diagram for an
example). Wins require up to 44 moves (Nunn 2002a:329,379), a b c d e f g h
(Stiller 1996:175).[16] Whomever moves first wins (Nunn)
Queen and a minor piece versus a rook and two minor pieces: In a typical stable position, queen and knight win
against rook, bishop, and knight, but mating requires up to 545 moves.[19] Other piece combinations are a draw,
except that a queen and a minor piece win against a rook and a same colored bishop pair. The KQN v KRBN win
is surprising since the difference in material is only one point (other pawnless combinations up to seven pieces
require greater difference to win), and a queen and a minor piece draw against a queen. However, compared to
KQ, KRBN is vulnerable to fork and capture by the opposing queen, and KRBN is slowly outmaneuvered by
KQN, until KQN wins a piece or a rook–knight exchange. Also, while in most open endgames, a knight is weaker
than a bishop, a queen and a knight make a strong attacking combination. Also, two knights make a strong
defense if the superior side does not have an extra piece that can be exchanged for the two knights, and we
have KQ v KNN draw (and thus KQN v KRNN draw) despite KRB v KNN win.
White could have won more quickly by 1.Qg8+ Kh4 2.Qg3+ Kxh5 3.Qg6+ 2 2
Kh4 4.Qh6+ and White skewers the black queen (Speelman 1981:108). 1 1
a b c d e f g h
White to move wins with 1.Qg8+ or
1.Qe6+
5 5
4 4
3 3
2 2
1 1
a b c d e f g h
Position after 68.Nxb3, a theoretical draw
1. Be5+ Ka8
2. Qb5!
2... Qa7+! 3. Ke2! Qb6! 4. Qd5+ Qb7 5. Qa5+ Qa7 6. Qb4! Qa6+ 7. Kd2! Qc8 8. Qa5+
Kb7 9. Qb5+ Ka8 10. Bd6! Qb7 11. Qe8+ Ka7 12. Bc5+ Ka6 13. Qa4# (Nunn
2002b:48,232).
V. Halberstadt, 1967
a b c d e f g h
8 8
7 7
6 6
5 5
4 4
3 3
2 2
1 1
a b c d e f g h
White to move and win
1 1
a b c d e f g h
Position after 63. Kxh4. The game was
drawn on move 115.
Two bishops versus one bishop: The easiest for the defender to draw, unless the king is caught in a
corner.
Two knights versus one bishop: any normal position is an easy draw.
Two knights versus one knight: an easy draw if the king is not trapped on the edge. However, if the king is
trapped on the edge, there may be a win similar to the two knights versus a pawn endgame.
Bishop and knight versus a bishop on the same color: may be lost if the king is on the edge; otherwise an
easy draw.
Bishop and knight versus a bishop on the opposite color: normally a draw but the defense may be difficult
if the defending king is confined near a corner that the attacking bishop controls.
Bishop and knight versus a knight: best winning chances (other than two bishops versus knight). The
difficulty of defense is not clear and the knight can be lost if it is separated from its king (Mednis 1996:36–
40).
Three knights and a king can force checkmate against a lone king within 20 moves (unless the defending king
can win one of the knights), but this can only happen if the attacking side has underpromoted a pawn to a knight.
(Fine 1941:5–6).
Three minor pieces versus one minor piece: a win except in some unusual situations involving an
underpromotion to a bishop on the same color as a player's existing bishop. More than fifty moves may be
required to win (Müller & Lamprecht 2001:403,406). Three knights win against one knight (Dvoretsky 2011:283).
Three minor pieces versus two minor pieces: if neither player has a pair of same-colored bishops, this is a
draw except in the cases of two bishops and a knight versus two knights, and two bishops and a knight versus
bishop and knight, which are wins. (In other words, if there are no same-colored bishop pairs, this is a won
endgame exactly when the stronger side has the bishop pair and the weaker side lacks it.) There are also wins in
some unusual situations where underpromotion has resulted in one player having two bishops travelling on the
same colors.[24]
Two minor pieces:
The game might continue 84.Kd7 Kb6 85.Nb3 Be3, followed by ...Bd1 and ...Bd4 (Speelman 1981:109–10), for example 86.Kd6
Bd1 87.Na1 Bd4 88.Kd5 Bxa1 (Hooper 1970:5).
1... Re3 7 7
2. Bd4 Re2+
6 6
3. Kc1 Nb4
4. Bg7 Rc2+ 5 5
5. Kd1 Be2+
4 4
6. resigns, because 6. Ke1 Nd3 is checkmate
(Speelman 1981:108–9). 3 3
2 2
1 1
a b c d e f g h
Black to move, wins
In this position, if White could exchange bishops (or rooks) he would reach Vladimorov vs. Palatnik, 1977
a drawn position. However, Black has a winning attack: a b c d e f g h
8 8
1... Rb3+
2. Kh2 Bc6 7 7
3. Rb8 Rc3
6 6
4. Rb2 Kf5
5. Bg3 Be4 5 5
6. Re2 Bg5 4 4
7. Rb2 Kg4
8. Rf2 Rc1 3 3
9. resigns, (Speelman 1981:109). 2 2
Summary
Grandmaster Ian Rogers summarized several of these endgames (Rogers 2010:37–39).
Recap of some pawnless endgames
Attacker Defender Status Assessment
Win Difficult[28]
Draw Easy
Draw Easy
Win Easy
Draw Easy
Fine's rule
In his landmark 1941 book Basic Chess Endings, Reuben Fine inaccurately stated, "Without pawns one must be at least a Rook
ahead in order to be able to mate. The only exceptions to this that hold in all cases are that the double exchange wins and that a
Queen cannot successfully defend against four minor pieces." (Fine 1941:572) Kenneth Harkness also stated this "rule" (Harkness
1967:49). Fine also stated "There is a basic rule that in endings without pawns one must be at least a rook ahead to be able to win
in general." (Fine 1941:553) This inaccurate statement was repeated in the 2003 edition revised by Grandmaster Pal Benko (Fine
& Benko 2003:585). However, Fine recognized elsewhere in his book that a queen wins against a rook (Fine 1941:561) and that a
queen normally beats a knight and a bishop (with the exception of one drawing fortress) (Fine 1941:570–71). The advantage of a
rook corresponds to a five-point material advantage using the traditional relative value of the pieces (pawn=1, knight=3,
bishop=3, rook=5, queen=9). It turns out that there are several more exceptions, but they are endgames that rarely occur in actual
games. Fine's statement has been superseded by computer analysis (Howell 1997:136).
A four-point material advantage is often enough to win in some endings without pawns. For example, a queen wins versus a rook
(as mentioned above, but 31 moves may be required); as well as when there is matching additional material on both sides, i.e.: a
queen and any minor piece versus a rook and any minor piece; a queen and a rook versus two rooks; and two queens versus a
queen and a rook. Another type of win with a four-point material advantage is the double exchange – two rooks versus any two
minor pieces. There are some other endgames with four-point material differences that are generally long theoretical wins. In
practice, the fifty-move rule comes into play because more than fifty moves are often required to either checkmate or reduce the
endgame to a simpler case: two bishops and a knight versus a rook (requires up to 68 moves); and two rooks and a minor piece
versus a queen (requires up to 82 moves for the bishop, 101 moves for the knight).
A three-point material advantage can also result in a forced win, in some cases. For instance, some of the cases of a queen versus
two minor piece are such positions (as mentioned above). In addition, the four minor pieces win against a queen. Two bishops
win against a knight, but it takes up to 66 moves if a bishop is initially trapped in a corner (Nunn 1995:265ff).
There are some long general theoretical wins with only a two- or three-point material advantage but the fifty-move rule usually
comes into play because of the number of moves required: two bishops versus a knight (66 moves); a queen and bishop versus
two rooks (two-point material advantage, can require 84 moves); a rook and bishop versus a bishop on the opposite color and a
knight (a two-point material advantage, requires up to 98 moves); and a rook and bishop versus two knights (two-point material
advantage, but it requires up to 222 moves) (Müller & Lamprecht 2001:400–6) (Nunn 2002a:325–29).
Finally, there are some other unusual exceptions to Fine's rule involving underpromotions. Some of these are (1) a queen wins
against three bishops of the same color (no difference in material points), up to 51 moves are required; (2) a rook and knight win
against two bishops on the same color (two point difference), up to 140 moves are needed; and (3) three bishops (two on the same
color) win against a rook (four point difference), requiring up to 69 moves, and (4) four knights win against a queen (85 moves).
This was proved by computer in 2005 and was the first ending with seven pieces that was completely solved. (See endgame
tablebase.)
Tables
This a table listing several pawnless endings, the number of moves in the longest win, and the winning percentage for the first
player. The winning percentage can be misleading – it is the percentage of wins out of all possible positions, even if a piece can
immediately be captured or won by a skewer, pin, or fork. The largest number of moves to a win is the number of moves until
either checkmate or transformation to a simpler position due to winning a piece. Also, the fifty-move rule is not taken into
account (Speelman, Tisdall & Wade 1993:7–8).
Common pawnless endgames
Attacking pieces Defending pieces Longest win Winning %
— 10 100
— 16 100
10 42
31 99
18 35
27 48
— 19 99.97
— 33 99.5
30 94
67 92.1
33 53.4
41 48.4
71 92.1
42 93.1
63 89.7
59 40.1
33 35.9
66 91.8
243[31] 78
223 96
190 72
153 86
140 77
101 94
99 69
98 87
92 86
92 83
86 94
85 92
82 96
75 72
73 87
73 81
72 94
71 90
69 80
68 95
65 98
63 85
54 73
52 65
51 82
49 53
48 92
46 66
44 83
44 75
38 63
37 94
36 68
35 75
32 62
32 61
31 99
29 63
27 57
18 67
12 62
Many of the combinations listed involve single piece capture and transposition into six-piece territory almost
immediately from the starting position.
Seven-piece endgames
Attacking Defending Longest win (distance to
Winning %
pieces pieces mate)
304 ?
262 ?
262 ?
246 ?
246 ?
238 ?
232 ?
229 ?
212 ?
210 ?
197 ?
195 ?
192 ?
182 ?
176 ?
176 ?
169 ?
154 ?
152 ?
150 ?
149 ?
140 ?
136 ?
134 ?
122 ?
120 ?
117 ?
115 ?
112 ?
106 ?
105 ?
102 ?
98 ?
88 ?
86 ?
77 ?
70 ?
See also
Checkmate
Chess piece relative value
Notes
1. Gelfand vs. Svidler (http://www.chessgames.com/perl/chessgame?gid=1210725)
2. ChessBase and ChessGames.com give Gelfand as White but Makarov gives Svidler as White. Makarov also
makes a White/Black error in discussing the game.
3. Morozevich vs. Jakovenko (http://www.chessgames.com/perl/chessgame?gid=1442203)
4. Browne vs BELLE, game 1 (http://www.chessgames.com/perl/chessgame?gid=1480950)
5. Browne vs BELLE, game 2 (http://www.chessgames.com/perl/chessgame?gid=1480951)
6. Pachman vs. Guimard (http://www.chessgames.com/perl/chessgame?gid=1104804)
7. Topalov vs. Polgar (http://chess.maribelajar.com/chesspublisher/viewgame.php?id=1208631002)
8. This ending was the subject of the oldest documented endgame study, by al-Aldi in the 9th century AD. Studies
from this period involving other pieces are no longer valid because the rules have changed. Hawkins, Jonathan,
Amateur to IM, 2012, p. 179, ISBN 978-1-936277-40-7
9. http://www.chessgames.com/perl/chessgame?gid=1411263
10. Incidentally, the longest decisive game (210 moves) between masters under standard time controls ended with
this material, see Neverov vs. Bogdanovich (http://www.chessgames.com/perl/chessgame?gid=1721829). Andy
Soltis, "Chess to Enjoy", Chess Life, p. 12, Dec. 2013, and chessbase article: "210-move drama in Kiev" (http://e
n.chessbase.com/post/210-move-drama-in-kiev-270613).
11. Topalov vs. J. Polgar, 2008 (http://www.chessgames.com/perl/chessgame?gid=1489805)
12. Timman vs. Lutz, 1995 (http://www.chessgames.com/perl/chessgame?gid=1143375)
13. J. Polgar vs. Kasparov, 1996 (http://www.chessgames.com/perl/chessgame?gid=1070866)
14. Alekhine vs. Capablanca, 1927 (http://www.chessgames.com/perl/chessgame?gid=1012508)
15. Karpov vs. Ftáčnik 1988 (http://www.chessgames.com/perl/chessgame?gid=1046015)
16. "In a battle where both sides have two queens and nothing else, the player who begins with check can win
because the queens are of overpowering strength against a naked king." (Benko 2007:70)
17. Such an underpromotion occurred in Dinara Dordzhieva vs Alexandra Kosteniuk, Russian Team Championship
(Women) R6, (7 May 2018), Sochi.[1] (http://www.chessgames.com/perl/chessgame?gid=1920106) This was not
strictly a pawnless endgame, because there were two blocked pawns on the a-file, but they did not change the
principle involved.
18. "The rule of thumb which governs endgames such as queen and rook versus queen and rook or two queens
versus two queens is 'Whoever checks first wins'. In many cases it is a valid principle and certainly if the
attacking force is well-coordinated, it can usually force mate or win material by a series of checks. However, there
are many cases in which the win is not so easy... The sequence of checks must be quite precise..." (Nunn
2002a:379). In a rook and pawn ending, if both sides queen a pawn, the side that gives check first frequently
wins. (Müller & Pajeken 2008:223)
19. However, most positions in this endgame have immediate threats, and in a large fraction of random positions,
KRBN can draw by trapping/capturing/exchanging the opposing knight, or using this and other threats to force
move repetition; there is also a drawing fortress position (with Na2 Bc3 Rd4).
20. Spassky vs. Karpov, 1982 (http://www.chessgames.com/perl/chessgame?gid=1068273)
21. Karpov vs. Kasparov, 1991 (http://www.chessgames.com/perl/chessgame?gid=1067317)
22. Francisco Vallejo Pons vs Magnus Carlsen (http://www.chessgames.com/perl/chessgame?gid=1954368),
GRENKE Chess Classic, Karlsruhe GER, rd 2, 21 April 2019.
23. Open chess diary (https://timkr.home.xs4all.nl/chess2/diary_15.htm) by Tim Krabbé, entry 298
24. http://rybkaforum.net/cgi-bin/rybkaforum/topic_show.pl?tid=25373 (post by Marc Bourzutschky, specialist in
endgame tablebases)
25. Botvinnik vs. Tal, 1961 (http://www.chessgames.com/perl/chessgame?gid=1032550)
26. Botvinnik vs. Tal, 1961 World Championship Game 17 (http://www.chessgames.com/perl/chessgame?gid=10325
50) game score at chessgames.com
27. At the time, it was known that this fortress could be broken down after many moves, but it was thought that the
defender could then probably form the fortress again in another corner. Computer analysis done later showed
that the attacker can prevent the defender from re-forming the fortress, but the fifty-move rule may be applicable
in this case.
28. Rogers says that this endgame has an undeserved reputation for being difficult, but that it is hard to go wrong
with the queen. Nunn notes that it is difficult for a human to play either side perfectly. Capablanca says this is a
very difficult position to win with queen; when the defense is skillful only a very good player can win. Pandolfini
says that it is not easy (Pandolfini 2009:67).
29. Nunn says that this endgame is tricky to defend and there are many marginal positions that require very precise
defense to draw.
30. Nunn points out that there is only one drawing fortress, but the win for the queen is long and difficult (it often
requires more than fifty moves).
31. Stiller and Nunn both say 243, but Müller & Lamprecht say 242
References
Benko, Pal (2007), Pal Benko's Endgame Laboratory, Ishi Press, ISBN 0-923891-88-9
Dvoretsky, Mark (2011), Dvoretsky's Endgame Manual, Russell Enterprises, ISBN 978-1-936490-13-4
Fine, Reuben (1941), Basic Chess Endings (1st ed.), McKay, ISBN 0-679-14002-6
Fine, Reuben; Benko, Pal (2003) [1941], Basic Chess Endings (2nd ed.), McKay, ISBN 0-8129-3493-8
Grivas, Efstratios (2008), Practical Endgame Play – mastering the basics, Everyman Chess, ISBN 978-1-85744-
556-5
Harkness, Kenneth (1967), Official Chess Handbook, McKay
Hooper, David (1970), A Pocket Guide to Chess Endgames, Bell & Hyman, ISBN 0-7135-1761-1
Hooper, David; Whyld, Kenneth (1992), The Oxford Companion to Chess (2nd ed.), Oxford University Press,
ISBN 0-19-280049-3
Horwitz, Bernhard; Kling, Josef (1986), Chess Studies and End-Games (1851, 1884), Olms, ISBN 3-283-00172-3
Howell, James (1997), Essential Chess Endings: The tournament player's guide, Batsford, ISBN 0-7134-8189-7
Károlyi, Tibor; Aplin, Nick (2007), Endgame Virtuoso Anatoly Karpov, New In Chess, ISBN 978-90-5691-202-4
Kasparov, Garry (2010), Modern Chess: Part 4, Kasparov vs Karpov 1988–2009, Everyman Chess, ISBN 978-1-
85744-652-4
Levenfish, Grigory; Smyslov, Vasily (1971), Rook endings, Batsford, ISBN 0-7134-0449-3
Lutz, Christopher (1999), Endgame Secrets: How to plan in the endgame in chess, Batsford, ISBN 978-0-7134-
8165-5
Makarov, Marat (2007), The Endgame, Chess Stars, ISBN 978-954-8782-63-0
Matanović, Aleksandar (1993), Encyclopedia of Chess Endings (minor pieces), 5, Chess Informant
Mednis, Edmar (1996), Advanced Endgame Strategies, Chess Enterprises, ISBN 0-945470-59-2
Müller, Karsten; Lamprecht, Frank (2001), Fundamental Chess Endings, Gambit Publications, ISBN 1-901983-
53-6
Müller, Karsten; Pajeken, Wolfgang (2008), How to Play Chess Endings, Gambit Publications, ISBN 978-1-
904600-86-2
Nunn, John (1995), Secrets of Minor-Piece Endings, Batsford, ISBN 0-8050-4228-8
Nunn, John (2002a), Secrets of Pawnless Endings (2nd ed.), Gambit Publications, ISBN 1-901983-65-X
Nunn, John (2002b), Endgame Challenge, Gambit Publications, ISBN 978-1-901983-83-8
Nunn, John (2007), Secrets of Practical Chess (2nd ed.), Gambit Publications, ISBN 978-1-904600-70-1
Pandolfini, Bruce (2009), Endgame Workshop: Principles for the Practical Player, Russell Enterprises, ISBN 978-
1-888690-53-8
Rogers, Ian (January 2010), "The Lazy Person's Guide to Endgames", Chess Life, 2010 (1): 37–41
Roycroft, A. J. (1972), Test Tube Chess, Stackpole, ISBN 0-8117-1734-8
Speelman, Jon (1981), Endgame Preparation, Batsford, ISBN 0-7134-4000-7
Speelman, Jon; Tisdall, Jon; Wade, Bob (1993), Batsford Chess Endings, B. T. Batsford, ISBN 0-7134-4420-7
Staunton, Howard (1848), The Chess-Player's Handbook (2nd ed.), Henry C. Bohn
Stiller, Lewis (1996), "On Numbers and Endgames: Combinatorial Game Theory in Chess Endgames", in
Nowakowski, Richard (ed.), Multilinear Algebra and Chess Endgames, Cambridge University Press, ISBN 0-521-
57411-0
Further reading
Ward, Chris (1996), Endgame Play, Batsford, ISBN 0-7134-7920-5 Pawnless endings are discussed on pages
87–96.
Pachman, Luděk (1983), Chess Endings for the Practical Player, Routledge & Kegan Paul, ISBN 0-7100-9266-0
Pawnless endings are discussed on pages 9–22.
External links
Book review (http://www.cs.unimaas.nl/icga/journal/contents/content25-2.htm#SECRETS)
Interactive Chess Endgames vs Chess Computer (http://www.chessvideos.tv/endgame-training/endgame-simulat
ions.php)
Sergienko vs. Vescovi Moscow 2010, R+3N vs. R+B+N (http://www.chessgames.com/perl/chessgame?gid=1572
860)
Volkov vs. Minasian Moscow 2009, Q+R+N vs. 2Q (http://www.chessgames.com/perl/chessgame?gid=1535815)
Text is available under the Creative Commons Attribution-ShareAlike License; additional terms may apply. By using
this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia
Foundation, Inc., a non-profit organization.