![PG in 20.0 moves [2/26]](/img/uisvg/forum-heading/puzzles.svg){kind=icon}
How do you go about solving proof games?Set up a board and play through? In this example I can see certain moves that need to be made but I wouldn't know what order to put them in or how certain positions would be arrived at.
For instance the white queen, I'm guessing he took the rook on h8 but then why go to g7?
Originally posted by andomasahashiHmm, the black rook may have been captured on e3 by the white pawn (how else does the pawn get there?), and the knight could have moved out of the way to let the rook out and then back in again. Most moves in a proof game will be non-sensical to a normal chess player--don't think why, but think how?
How do you go about solving proof games?Set up a board and play through? In this example I can see certain moves that need to be made but I wouldn't know what order to put them in or how certain positions would be arrived at.
For instance the white queen, I'm guessing he took the rook on h8 but then why go to g7?
Originally posted by andomasahashiMy first advice - count the pieces of both sides that are left, account for the possible pawn captures (as here it is obvious that d2xe3 and b7xc6 and e7xd6 were such). You now should have pretty good idea what pieces were captured on that squares (though how they came there is sometimes harder to guess).
How do you go about solving proof games?Set up a board and play through? In this example I can see certain moves that need to be made but I wouldn't know what order to put them in or how certain positions would be arrived at.
For instance the white queen, I'm guessing he took the rook on h8 but then why go to g7?
What usually helps me tremendously - find the minimum number of moves for White to reach the position (ignore Black). Do the same with Black. Assume shortest paths for all pieces. Most probably one of the sides will have the exact number of moves required in the PG. So if it is White, Black would have to ensure that White can make all that moves in this shortest time (Black plays to assist White, in other word). Look for "spare" moves - moves that don't obstruct the path a piece should go through. These together with some additional info will quickly nail down the order of the moves (the spare moves are usually the first few before Black can unblock some of the paths).
Solution:
1.c4 Na6 2.c5 Rb8 3.c6 bxc6 4.b4 Rb5 5.Ba3 Re5 6.b5 Re3 7.dxe3 Nh6 8.Qd6 exd6 9.b6 Qg5 10.b7 Be7 11.b8=Q O-O 12.Qb2 Bb7 13.Kd2 Ra8 14.Kc3 Nb8 15.Kb4 Kf8 16.Qxg7+ Ke8 17.Nc3 Bf8 18.Rb1 Qd8 19.Ka5 Bc8 20.Rb7 Ng8
It seems paradoxical that Black has to clear the entire back row just to play the one move Rh8-a8. The key lies in the two bP captures. White is missing Pb and c, but Black captured on c and d. White would need to shift his pawns one file each to avoid having to promote. The trouble is that one of Black's two missing units is Pg7, which is too far to sac to a wP.
So, White has to promote, and we can follow ilywrin's suggestion of counting the minimum number of moves needed for each White piece.
2 - Rb7
2 - Qg7
4 - Ka5
1 - Ba3
1 - Nc3
1 - Pe3
-----
11 total
Add moves by the 'hidden' pieces:
5 - Pb2 promoted
3 - Pc2 sacrificed itself on c6 [no reason to shift files here]
1 - Qd1-d6 [fastest possible way to sacrifice on d6 - since we're promoting, this is OK. The promoted piece can get to g7 just as fast as the original Q can.]
-----
20 total
White's 20 moves are all spoken for. His schedule of moves gradually forces the conclusion that bR will travel along the 8th rank. Pg7 will be captured late in the game, so the g-file does not work out. The e-file is too crowded; it is difficult to shuffle K and Bf8 around the Rook before the promoted Q crashes into g7.
By elimination, the bR must route thru the 8th rank, which works if the moves are carefully timed.
Composer: Satoshi Hashimoto