The exchange (chess)
[dummy-text]
The exchange (chess)
Jump to navigation
Jump to search
The exchange in chess refers to a situation in which one player loses a minor piece (i.e. a bishop or knight) but captures the opponent's rook. The side which wins the rook is said to have won the exchange, while the other player has lost the exchange, since the rook is usually more valuable. Alternatively, the side that has won the rook is up the exchange, and the other player is down the exchange. The opposing captures often happen on consecutive moves, although this is not strictly necessary. It is generally detrimental to lose the exchange, although occasionally one may find reason to purposely do so; the result is an exchange sacrifice (see below). The minor exchange is an uncommon term for the exchange of a bishop and knight.
Note that the exchange differs from the more general "exchange" or "an exchange", which refers to the loss and subsequent gain of arbitrary pieces, for example to "exchange queens" would mean that each side's queen is captured (Hooper & Whyld 1992, p. 130).
.mw-parser-output .tocleftfloat:left;clear:left;width:auto;background:none;padding:.5em .8em 1.4em 0;margin-bottom:.5em.mw-parser-output .tocleft-clear-leftclear:left.mw-parser-output .tocleft-clear-bothclear:both.mw-parser-output .tocleft-clear-noneclear:none
Contents
1 Value of the exchange
2 In the endgame
3 The exchange sacrifice
3.1 Sokolov vs. Kramnik
3.2 Reshevsky vs. Petrosian
3.3 Petrosian vs. Spassky
3.4 Kasparov vs. Shirov
4 Minor exchange
5 See also
6 References
7 Further reading
| This article uses algebraic notation to describe chess moves. |
Value of the exchange[edit]
The value of the exchange (i.e. the difference between a rook and a minor piece) has been considered for decades. Siegbert Tarrasch put its value as 1½ pawns in the endgame, but not for the opening or the first part of the middlegame. That is widely accepted today, but Jacob Sarratt, Howard Staunton, and José Capablanca felt that the exchange was worth two pawns. Tigran Petrosian thought that one pawn was the right value. Wilhelm Steinitz said that a rook is slightly better than a knight and two pawns but slightly worse than a bishop and two pawns (Soltis 2004:110). Cecil Purdy said that the value depends on the total number of pawns on the board. The reason is that when there are many pawns, the rooks will have limited mobility because there will not be open files. The exchange is barely worth 1½ points when there are 14 or more pawns on the board. Only when there are ten or fewer pawns may the exchange be worth 2 points (Soltis 2004:134). Purdy gave the value as 1½ points in the opening and increasing to 2 points in the endgame. In the middlegame the value would be closer to 1½ than to 2 (Purdy 2003:146–52). Edmar Mednis gave the value as 1½ in the endgame (Mednis 1978:120), (Mednis 1987:107). Max Euwe put the value at 1½ in the middlegame and said that two pawns are more than sufficient compensation for the exchange (Euwe & Kramer 1994:38). Larry Kaufman's computer research puts the value as 1¾ pawns, but only 1¼ pawns if the player with the minor piece has the bishop pair (Soltis 2004:110). Hans Berliner puts the difference between a rook and knight as 1.9 pawns and the difference between a rook and a bishop as 1.77 pawns (Berliner 1999:14). In practice, one pawn may be sufficient compensation for the loss of the exchange, whereas two pawns almost always is (Soltis 2004:110).
In the endgame[edit]
In the middlegame, the advantage of an exchange is usually enough to win the game if the side with the rook has one or more pawns. In an endgame without pawns, the advantage of the exchange is normally not enough to win (see pawnless chess endgame). The most common exceptions when there are no pawns are (1) a rook versus a bishop in which the defending king is trapped in a corner of the same color as his bishop, (2) a knight separated from its king that may be cornered and lost, and (3) the king and knight are poorly placed (Nunn 2002:9,31).
In the endgame of a rook and a pawn versus a knight and a pawn, if the pawns are passed the rook is much stronger and should win. If the pawns are not passed, the side with knight has good drawing chances if its pieces are well-placed (Müller & Lamprecht 2001:260–63).
In the endgame of a rook and a pawn versus a bishop and pawn, If the pawns are on the same file, the bishop has good chances to draw if the pawns are blocked and the opposing pawn is on a square the bishop can attack; otherwise the rook usually wins. If the pawns are passed the rook normally wins. If the pawns are not passed and are on adjacent files, it is difficult to assess but the bishop may be able to draw (Müller & Lamprecht 2001:274–79).
| 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 | ||
In an endgame with more pawns on the board (i.e. a rook and pawns versus a minor piece with the same number of pawns) the rook usually wins (Müller & Lamprecht 2001:256–91). This position is typical. The superior side should remember these things:
- the main idea is to get the king through to capture opposing pawns
- force as many opposing pawns as possible onto the same color square as the bishop
- some pawn exchanges may be necessary to open files, but keep pawns on both sides of the board
- try to keep the position unbalanced. A passed pawn almost immediately becomes a winning advantage (Fine & Benko 2003:478–79).
If the minor piece has an extra pawn (i.e. one pawn for the exchange), the rook should win, but with difficulty. If the minor piece has two extra pawns, the endgame should be a draw (Fine & Benko 2003:478ff).
The exchange sacrifice [edit]
An exchange sacrifice occurs when one player gives up a rook for a minor piece. It is often used to destroy the enemy pawn structure (as in several variations of the Sicilian Defence where Black captures a knight on c3 with a rook), to establish a minor piece on a strong square (often threatening the enemy king), to improve one's own pawn structure (creating, for example, connected passed pawns such as in A Yurgis vs. Botvinnik, 1931), or to gain time for development. The exchange sacrifice contrasts with other sacrifices in that during the early-middle to middle game the board is sufficiently crowded to where the rook is not as effective as an active knight or a good bishop, this is why such exchange sacrifices happen usually from moves 20 to 30, and rarely occur in the later moves. When they do occur in the endgame, it is usually to create and promote a passed pawn (Soltis 2004:115). Subsequently, the relative importance of the pieces might be different than the standardized Chess piece relative value system and takes advantage of the fluctuating values of the pieces during the progression of the game. The sacrifice might also be used to increase the influence of one's own minor pieces by eliminating opposition from their counterparts (such as in the Petrosian versus Spassky game below, where even a double exchange sacrifice was successful). A common example of this idea is the elimination an opponent's bishop, with the expectation that in doing so one's own bishop will increase in power from being unopposed on the color squares in which it resides. There is often more dynamic play and positional considerations such as pawn structure or piece placement compared to sacrifices due to a mating attack or a pawn sacrifice to gain the initiative. Sometimes the exchange can be sacrificed purely on long term positional objectives, as frequently demonstrated by former world champion Tigran Petrosian.
Sokolov vs. Kramnik[edit]
| 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 | ||
In this 2004 game[1] between Ivan Sokolov and World Champion Vladimir Kramnik, White gave up the exchange for a pawn in order to create two strong connected passed pawns. The game continued:
- 33. Rxc7! Qxc7
- 34. Rxf6 Rxf6
- 35. Qxf6 Rf8
and White won on move 41 (Soltis 2004:110).
Reshevsky vs. Petrosian[edit]
| 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 | ||
Tigran Petrosian, the World Champion from 1963–1969, was well known for his especially creative use of this device. He once responded (only half jokingly), when asked what was his favourite piece, as saying "The rook, because I can sacrifice it for minor pieces!"[citation needed] In the game Reshevsky versus Petrosian at the 1953 Candidates Tournament in Zurich,[2] he sacrificed the exchange on move 25, only for his opponent to sacrifice it in return on move 30. This game is perhaps the most famous and most frequently taught example of the exchange sacrifice.
There are no open files in this position for the rooks to exploit. Black sacrificed the exchange with
- 25... Re6!!
With the rook not on e7, the black knight will be able to get to a strong outpost on d5. From there the knight will be attacking the pawn on c3, and if the white bishop on b2 does not move to d2, it will be of little use. In addition, it will be practically impossible to break Black's defense on the white squares. The next few moves were:
- 26. a4?! Ne7!
- 27. Bxe6 fxe6
- 28. Qf1! Nd5
- 29. Rf3 Bd3
- 30. Rxd3 cxd3
The game was drawn on move 41 (Kasparov 2004:14).
Petrosian vs. Spassky[edit]
| 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 | ||
In the tenth game from the 1966 World Chess Championship between defending champion Tigran Petrosian and challenger Boris Spassky contained two exchange sacrifices by White.[3] Black had just moved
20... Bh3?! (first diagram)
White responded with an exchange sacrifice:
- 21. Ne3!
White had no choice: 21. Rf2? Rxf4 22. Rxf4 Qg5+, etc. The game continued:
- 21... Bxf1?
- 22. Rxf1 Ng6
23. Bg4! Nxf4?! (second diagram)
| 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 | ||
And now a second exchange sacrifice:
- 24. Rxf4! Rxf4
Black is helpless, despite being two exchanges ahead. White won back an exchange on move 29. On move 30 White forced the win of the other rook and the exchange of queens. Black resigned because the position was a winning endgame for White (two knights and five pawns versus one knight and four pawns) (Kasparov 2004:72–74). Petrosian won the match by one game to retain his title.
Kasparov vs. Shirov[edit]
| 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 | ||
In a 1994 game between World Champion Garry Kasparov and Alexei Shirov,[4] White sacrificed a pure exchange (rook for a bishop) with the move 17. Rxb7!!. As compensation for the sacrifice, Black became weak on the white squares, which were dominated by White's bishop. The exchange sacrifice also deprived Black of the bishop pair and his remaining bishop was a bad bishop. During the game, many spectating grandmasters were sceptical whether White's compensation was enough. Black returned the exchange on move 28, making the material equal, but White had a strong initiative. Black missed a better 28th move after which White could have forced a draw, but would have had no clear advantage. White won the game on move 38 (Nunn 2001:149–58).
Minor exchange[edit]
The minor exchange refers to the capture of the opponent's bishop for the player's knight (or, more recently, the stronger minor piece for the weaker) (Soltis 2004:169). Bobby Fischer used the term (Benko 2007:192,199,216), but it is rarely used.
In most chess positions, a bishop is worth slightly more than a knight because of its longer range of movement. As a chess game progresses, pawns tend to get traded, removing support points from the knight and opening up lines for the bishop. This generally leads to the bishop's advantage increasing over time.
Traditional chess theory espoused by masters such as Wilhelm Steinitz and Siegbert Tarrasch puts more value on the bishop than the knight. In contrast, the hypermodern school favored the knight over the bishop. Modern theory is that it depends on the position, but that there are more positions where the bishop is better than where the knight is better (Mayer 1997:7).
There are some occasions when a knight can be worth more than a bishop, so this exchange is not necessarily made at every opportunity to do so.
A rook and bishop usually work better together than a rook and knight in the endgame (Mayer 1997:201–8), (Beliavsky & Mikhalchishin 2000:141). José Raúl Capablanca stated that a queen and knight work better together than a queen and bishop in the endgame (Mayer 1997:209–18). More recently, John Watson has stated that from his study of this endgame that an unusually large proportion of queen and knight versus queen and bishop endings are drawn, and that most decisive games are characterized by the winning side having one or more obvious advantages (for example, having a knight against a bad bishop in a closed position, or having a bishop in a position with pawns on both sides of the board, particularly if the knight has no natural outpost). Watson states that positions in this endgame in general "are very volatile, and often the winning side is simply the one who starts out being able to win material or launch an attack on the opposing king" (Watson 1998:73). Glenn Flear agrees with that assessment for endgames. He could not find an endgame by Capablanca that supported his statement. The statistics for queen and bishop versus queen and knight endgames are about even. Most decisive games were won because of a significant advantage from the middlegame and only a limited number of positions show an inherent superiority for one over the other (Flear 2007:422).
See also[edit]
- Chess piece relative value
- Chess strategy
- Chess tactics
- Chess theory
- Exchange (chess)
References[edit]
^ Sokolov vs. Kramnik
^ Reshevsky vs. Petrosian, 1953
^ Petrosian vs. Spassky
^ Kasparov vs. Shirov, 1994
Bibliography
Beliavsky, Alexander; Mikhalchishin, Adrian (2000), Winning Endgame Strategy, Batsford, ISBN 0-7134-8446-2.mw-parser-output cite.citationfont-style:inherit.mw-parser-output .citation qquotes:"""""""'""'".mw-parser-output .citation .cs1-lock-free abackground:url("//upload.wikimedia.org/wikipedia/commons/thumb/6/65/Lock-green.svg/9px-Lock-green.svg.png")no-repeat;background-position:right .1em center.mw-parser-output .citation .cs1-lock-limited a,.mw-parser-output .citation .cs1-lock-registration abackground:url("//upload.wikimedia.org/wikipedia/commons/thumb/d/d6/Lock-gray-alt-2.svg/9px-Lock-gray-alt-2.svg.png")no-repeat;background-position:right .1em center.mw-parser-output .citation .cs1-lock-subscription abackground:url("//upload.wikimedia.org/wikipedia/commons/thumb/a/aa/Lock-red-alt-2.svg/9px-Lock-red-alt-2.svg.png")no-repeat;background-position:right .1em center.mw-parser-output .cs1-subscription,.mw-parser-output .cs1-registrationcolor:#555.mw-parser-output .cs1-subscription span,.mw-parser-output .cs1-registration spanborder-bottom:1px dotted;cursor:help.mw-parser-output .cs1-ws-icon abackground:url("//upload.wikimedia.org/wikipedia/commons/thumb/4/4c/Wikisource-logo.svg/12px-Wikisource-logo.svg.png")no-repeat;background-position:right .1em center.mw-parser-output code.cs1-codecolor:inherit;background:inherit;border:inherit;padding:inherit.mw-parser-output .cs1-hidden-errordisplay:none;font-size:100%.mw-parser-output .cs1-visible-errorfont-size:100%.mw-parser-output .cs1-maintdisplay:none;color:#33aa33;margin-left:0.3em.mw-parser-output .cs1-subscription,.mw-parser-output .cs1-registration,.mw-parser-output .cs1-formatfont-size:95%.mw-parser-output .cs1-kern-left,.mw-parser-output .cs1-kern-wl-leftpadding-left:0.2em.mw-parser-output .cs1-kern-right,.mw-parser-output .cs1-kern-wl-rightpadding-right:0.2em
Benko, Pal (2007), Pal Benko's Endgame Laboratory, Ishi Press, ISBN 0-923891-88-9
Berliner, Hans (1999), The System: A World Champion's Approach to Chess, Gambit Publications, ISBN 1-901983-10-2
Euwe, Max; Kramer, Hans (1994), The Middlegame: Book One: Static Features, Hays, ISBN 978-1-880673-95-9
Fine, Reuben; Benko, Pal (2003), Basic Chess Endings (1941), McKay, ISBN 0-8129-3493-8
Flear, Glenn (2007), Practical Endgame Play – beyond the basics: the definitive guide to the endgames that really matter, Everyman Chess, ISBN 978-1-85744-555-8
Golombek, Harry (1977), Golombek's Encyclopedia of Chess, Crown Publishing, ISBN 0-517-53146-1
Hooper, David; Whyld, Kenneth (1992), The Oxford Companion to Chess (2nd ed.), Oxford University Press, ISBN 0-19-866164-9
Kasparov, Garry (2004), My Great Predecessors, Part III, Everyman Chess, ISBN 978-1-85744-371-4
Mayer, Steve (1997), Bishop versus Knight: The Verdict, Batsford, ISBN 1-879479-73-7
Mednis, Edmar (1978), Practical Endgame Lessons, McKay, ISBN 0-67914-102-2
Mednis, Edmar (1987), Questions and Answers on Practical Endgame Play, Chess Enterprises, ISBN 0-931462-69-X
Müller, Karsten; Lamprecht, Frank (2001), Fundamental Chess Endings, Gambit Publications, ISBN 1-901983-53-6
Nunn, John (2001), Understanding Chess Move by Move, Gambit Publications, ISBN 978-1-901983-41-8
Nunn, John (2002), Secrets of Pawnless Endings (2nd ed.), Gambit Publications, ISBN 1-901983-65-X
Purdy, C.J.S. (2003), C.J.S. Purdy on the Endgame, Thinker's Press, ISBN 978-1-888710-03-8
Soltis, Andy (2004), Rethinking the Chess Pieces, Batsford, ISBN 0-7134-8904-9 Page 110-24 is about the exchange
Watson, John (1998), Modern Chess Strategy: Advances Since Nimzowitsch, Gambit Publications, ISBN 1-901983-07-2
Further reading[edit]
Peter Wells, "The Exchange Sacrifice Revisited – Part 1", ChessBase Magazine, #111, April 2006, pp. 18–24.
Categories:
- Chess terminology
- Chess strategy
- Chess theory
(window.RLQ=window.RLQ||).push(function()mw.config.set("wgPageParseReport":"limitreport":"cputime":"0.524","walltime":"0.634","ppvisitednodes":"value":3208,"limit":1000000,"ppgeneratednodes":"value":0,"limit":1500000,"postexpandincludesize":"value":175639,"limit":2097152,"templateargumentsize":"value":1719,"limit":2097152,"expansiondepth":"value":11,"limit":40,"expensivefunctioncount":"value":1,"limit":500,"unstrip-depth":"value":0,"limit":20,"unstrip-size":"value":35488,"limit":5000000,"entityaccesscount":"value":0,"limit":400,"timingprofile":["100.00% 381.105 1 -total"," 32.65% 124.432 18 Template:Citation"," 10.73% 40.906 1 Template:About"," 10.01% 38.157 1 Template:Citation_needed"," 9.81% 37.377 6 Template:Chess_diagram"," 9.28% 35.371 1 Template:AN_chess"," 8.60% 32.776 28 Template:Harvcol"," 8.39% 31.966 1 Template:Fix"," 5.35% 20.380 2 Template:Category_handler"," 4.92% 18.742 1 Template:Chess"],"scribunto":"limitreport-timeusage":"value":"0.194","limit":"10.000","limitreport-memusage":"value":5737977,"limit":52428800,"cachereport":"origin":"mw1271","timestamp":"20190324165936","ttl":2592000,"transientcontent":false););"@context":"https://schema.org","@type":"Article","name":"The exchange (chess)","url":"https://en.wikipedia.org/wiki/The_exchange_(chess)","sameAs":"http://www.wikidata.org/entity/Q574512","mainEntity":"http://www.wikidata.org/entity/Q574512","author":"@type":"Organization","name":"Contributors to Wikimedia projects","publisher":"@type":"Organization","name":"Wikimedia Foundation, Inc.","logo":"@type":"ImageObject","url":"https://www.wikimedia.org/static/images/wmf-hor-googpub.png","datePublished":"2005-10-23T22:58:07Z","dateModified":"2019-02-27T10:45:03Z","headline":"term in Chess theory"(window.RLQ=window.RLQ||).push(function()mw.config.set("wgBackendResponseTime":109,"wgHostname":"mw1329"););
