A proof game is a type of retrograde analysischess problem. The solver must construct a game starting from the initial chess position, which ends with a given position (thus proving that that position is reachable) after a specified number of moves. A proof game is called a shortest proof game if no shorter solution exists. In this case the task is simply to construct a shortest possible game ending with the given position.
When published, shortest proof games will normally present the solver with a diagram - which is the final position to be reached - and a caption such as "SPG in 9.0". "SPG" here is short for "shortest proof game" and the "9.0" indicates how many moves must be played to reach the position; 9.0 means the position is reached after black's ninth move, 7.5 would mean the position is reached after seven and a half moves (that is, after white's eighth move) and so on. Sometimes the caption may be more verbose, for example "Position after white's seventh move. How did the game go?".
Most published SPGs will have only one solution: not only must the moves in the solution be unique, their order must also be unique. They can present quite a strong challenge to the solver, especially as assumptions which might be made from a glance at the initial position often turn out to be incorrect. For example, a piece apparently standing on its initial square may turn out to actually be a promoted pawn (this is known as the Pronkin theme). There are some proofgames which have more than one solution, and the number of solutions is then given in the stipulation. The majority of SPGs have a solution from about six to about thirty moves, although examples with unique solutions more than fifty moves long have been devised.
A number of chess problem composers have specialised in SPGs, with one of the most notable examples being Michel Caillaud who did much to popularise the genre in the 1970s and 1980s.
Example problems
Ernest Clement Mortimer (version by A. Frolkin), Shortest Proof Games, 1991
Position after White's 7th move. How did the game go? (2 solutions)
A relatively simple example is given to the right. It is a version by Andrei Frolkin of a problem by Ernest Clement Mortimer, and was published in Shortest Proof Games (1991). It is an SPG in 4.0. It is natural to assume that the solution will involve the white knight leaving g1, capturing the d7 and e7 pawns and the g8 knight, and then being captured itself, but in fact the solution carries an element of paradox quite common in SPGs: it is the knight that started on b8 that has been captured and the knight now on that square has come from g8. The solution (the only possible way to reach the position after four moves) is 1. Nf3 e5 2. Nxe5 Ne7 3. Nxd7 Nec6 4. Nxb8 Nxb8.
A more complex proofgame, with more solutions, can be seen in the second diagram. The solutions are: 1. b4 h5 2. b5 Rh6 3. b6 Rc6 4. bxc7 Rxc2 5. cxb8=Q Rxd2 6. Qd6 Rxd1 7. Qxd1 and 3. ... Rd6 4. bxc7 Rxd2 5. cxb8=B Rxc2 6. Bbf4 Rxc1 7. Bxc1, showing the Pronkin theme in both solutions (in the first solution with a queen, in the second solution with a bishop).
Variations
There are a number of variations on SPGs. The problem may carry a stipulation similar to "Find a game with 8.b7-b8=N mate", which simply means a game must be constructed starting from the initial position and ending on the given move number with the given move. Or it may be a one-sided proof game, in which only white makes moves (this is the SPG analogue to the seriesmover in other types of chess problems). An alternative rule-set may also be specified (such as circe chess or losing chess), or a fairy piece may be substituted for an orthodox piece.
An SPG-type problem is to find the shortest game in which White's and Black's corresponding moves are mirror images of each other. Possible solutions are 1. d4 d5 2. Qd3 Qd6 3. Qh3 Qh6 4. Qxc8#, 1. d4 d5 2. Qd3 Qd6 3. Qf5 Qf4 4. Qxc8#, and 1. c4 c5 2. Qa4 Qa5 3. Qc6 Qc3 4. Qxc8#.
A Grimshaw is a device found in chess problems in which two black pieces arriving on a particular square mutually interfere with each other. It is named after the 19th-century problem composer Walter Grimshaw. The Grimshaw is one of the most common devices found in directmates.
In chess, a back-rank checkmate is a checkmate delivered by a rook or queen along a back rank in which the mated king is unable to move up the board because the king is blocked by friendly pieces on the second rank. A typical position is shown to the right.
Vasja Pirc was a leading Yugoslav (Slovenian) chess player. His name is most familiar to contemporary players as a strong exponent of the hypermodern defense now generally known as the Pirc Defense.
The Semi-Slav Defense is a variation of the Queen's Gambit chess opening defined by the position reached after the moves:
Rosendo Carreon Balinas Jr. was a chess grandmaster from the Philippines. FIDE awarded him the International Master title in 1975 and the International Grandmaster title in 1976. Balinas was a lawyer by profession, as well as an award winning chess writer and journalist.
Nolot is a chess test suite with 11 very difficult positions from real games. They were compiled by Pierre Nolot for the French chess magazine Gambisco and posted on the rec.games.chess Usenet group in 1994. Some of these positions were particularly hard to solve for chess engines at the time.
Deep Blue versus Garry Kasparov was a pair of six-game chess matches between the world chess champion Garry Kasparov and an IBM supercomputer called Deep Blue. The first match was played in Philadelphia in 1996 and won by Kasparov. The second was played in New York City in 1997 and won by Deep Blue. The 1997 match was the first defeat of a reigning world chess champion by a computer under tournament conditions.
The World Chess Championship 2008 was a best-of-twelve-games match between the incumbent World Chess Champion, Viswanathan Anand, and the previous World Champion, Vladimir Kramnik. Kramnik had been granted a match after not winning the World Chess Championship 2007 tournament.
The World Chess Championship 2010 match pitted the defending world champion, Viswanathan Anand, against challenger Veselin Topalov, for the title of World Chess Champion. The match took place in Sofia, Bulgaria from 24 April to 13 May 2010, with a prize fund of 2 million euros. Anand won the final game to win the match 6½–5½ and retain the title.
The World Chess Championship 1886 was the first official World Chess Championship match contested by Wilhelm Steinitz and Johannes Zukertort. The match took place in the United States, the first five games being played in New York City, the next four being played in St. Louis and the final eleven in New Orleans. The winner was the first player to achieve ten wins. Wilhelm Steinitz won the match 10–5, winning his tenth game in the twentieth game of the match. There were five draws.
The World Chess Championship 1889 was the second official World Chess Championship, and was between Wilhelm Steinitz and Mikhail Chigorin. It took place in Havana, Cuba. Steinitz successfully defended his world title, by being the first of the two players to reach 10½. He won the match 10½-6½.
The third World Chess Championship was held in New York City in late 1890 and early 1891. Holder Wilhelm Steinitz narrowly defeated his Hungarian challenger, Isidor Gunsberg.
A reflexmate is a chess problem in which white, moving first, must force black to deliver checkmate within a specified number of moves against his will - with the added condition that if either player can give checkmate, they must. If this condition applies only to Black, it is a semi-reflexmate.
The World Chess Championship 2012 was a chess match between the defending world champion Viswanathan Anand of India and Boris Gelfand of Israel, winner of the 2011 Candidates Tournament. After sixteen games, including four rapid games, Anand retained his title. The match, held under the auspices of the World Chess Federation FIDE, took place between 10 and 30 May 2012 in the Engineering Building of the State Tretyakov Gallery, Moscow, Russia. The prize fund was US$2.55 million.
The 1978 World Chess Championship was played between Anatoly Karpov and Viktor Korchnoi in Baguio, Philippines from July 18 to October 18, 1978. Karpov won, thereby retaining the title.
The 1981 World Chess Championship was played between Anatoly Karpov and Viktor Korchnoi in Merano, Italy from October 1 to November 19, 1981. Karpov won with six wins against two, with 10 draws. The two players had already played against each other in the World Chess Championship match 1978 in the Philippines, when Karpov also won.
Michel Caillaud is a French chess problemist.
The 1992 match between former World Chess Champions Bobby Fischer and Boris Spassky was billed as a World Chess Championship, but was unofficial. It was a rematch of the 1972 World Championship match. Fischer won 10–5, with 15 draws.
The World Chess Championship 2016 was a chess match between reigning world champion Magnus Carlsen and challenger Sergey Karjakin to determine the World Chess Champion. Carlsen has been world champion since 2013, while Karjakin qualified as challenger by winning the 2016 Candidates Tournament. The best-of-12 match, organized by FIDE and its commercial partner Agon, was played in New York City between 10 and 30 November 2016.
The World Chess Championship in 2018 was a match between the reigning world champion since 2013, Magnus Carlsen, and the challenger Fabiano Caruana to determine the World Chess Champion. The 12-game match, organised by FIDE and its commercial partner Agon, was played at The College in Holborn, London, between 9 and 28 November 2018. The games were broadcast on worldchess.com and by NRK.
This page is based on this Wikipedia article Text is available under the CC BY-SA 4.0 license; additional terms may apply. Images, videos and audio are available under their respective licenses.
