An “extraordinary” moment in Gukesh-Ding WCC Game 13 and knight-switching proof games
During Game 13 of the World Championship match between Gukesh and Ding, I was watching the livestream on Chess24 where the commentators (both terrific) were GM Peter Leko and GM Daniel (Danya) Naroditsky. When Gukesh played 15.Nh5 (see diagram below), an eagle-eyed Leko pointed out that this knight on the right-edge came all the way from b1 while the knight standing on c3 originated from g1. The two commentators were amused as well as amazed by such an unusual occurrence, with Leko calling it “extraordinary” and Danya saying his mind is blown. As a problemist I was reminded of certain proof game compositions where two equivalent pieces must paradoxically switch places, to attain a position as quickly as possible. Then to my surprise Danya expressed a similar thought.
Timestamp 2:17:25 Leko on swapped knights
Timestamp 2:18:54 Danya on 4-move problem
Referring to such problems as “chess riddles,” Danya tried to recall a famous 4-move proof game in which a black knight from g8 ended up on b8. He began to outline the final position as having black pawns on c6 and e6, but that’s incorrect as he apparently fused two distinct classic 4-move games. The well-known one with such black pawns is P0000811 created by Tibor Orban, and it features a different idea. He was accurate, though, in the rest of his description which fits another famous composed game by Ernest C. Mortimer, one in which a knight travels to its counterpart’s original square. Let’s take a look at this problem and other examples that develop the theme.
In proof game problems, the objective is to reach the diagram position from the opening array in the fewest possible moves, disregarding whether such moves are sensible or not. In this case, four moves (by each side) are allowed, and even though the two sides cooperate, there is no straightforward way to capture both of the ostensibly missing g-knights. For instance, 1.Nf3 Nh6 2.Nd4 Nf5 3.Nxf5 d5 4.Nd6+ Qxd6 clearly leaves the queen in the wrong spot. The surprising solution entails the capture of Black’s b-knight instead, meaning the piece on b8 is an impostor from g8. 1.Nf3 d5 2.Nd4 Nf6 3.Nc6 Nfd7 4.Nxb8 Nxb8. Here the move order is imprecise (alternative play like 2.Ne5 is possible), reflecting the problem’s early origin when such duals were inconsequential. Modern conventions require proof games to be solved by an exact sequence of unique moves.
As illustrated above, the interactive diagrams on Chess.com cannot hide the solution of a proof game. If you wish to solve the following three problems without additional hints, use these links to view the diagrams before scrolling down!
Mortimer’s composition is such a gem that it’s worthwhile to modify it to satisfy modern standards of soundness. The version above thus has a uniquely forced solution, 1.Nf3 e5 2.Nxe5 Ne7 3.Nxd7 Nec6 4.Nxb8 Nxb8. Another advantage here is the striking diagram position that displays a double homebase set-up, i.e. all uncaptured units of both players are (apparently) on their game-array squares.
Today we call Mortimer’s deceptive manoeuvre the Sibling theme, in which a knight (or a rook) on its home square turns out to have been replaced by its counterpart from the other side of the board. Proof game composers have elaborated on the theme in various ways, and my own take on it is shown below.
Black is missing a knight and the d-pawn while White is missing a knight and the c1-bishop. One obvious way to account for both pairs of doubled pawns is to sacrifice Black’s g-knight on f3 and White’s b-knight on h6, but this proves inefficient, e.g. 1.Nc3 d5 2.Nxd5 Nf6 3.Ne3 Ng4 4.Nf5 Ne5 5.Nh6 Nf3+ 6.exf3 gxh6 7.Bc4 Bg7 8.d3 0-0 9.Bb5 f6 and White’s c1-bishop cannot be removed in time. Black actually needs to sacrifice the original b-knight on f3 (taking three moves instead of four) to help speed up White’s development, which in turn enables the c1-bishop to be captured on h6 quickly. This plan entails three extra moves to transfer the g8-knight to b8, leaving Black with no time to move the d-pawn. If White attempts to use the original b-knight to capture this d7-pawn, it would take four moves which is too slow, e.g. 1.Na3 Nc6 2.Nc4 Ne5 3.Nb6 Nf3+ 4.exf3 Nf6 5.Nxd7 Nxd7 6.Bc4 Nb8 7.d3 f6 8.Bh6 gxh6 9.Ba6 Bg7 10.Bb5+ and the check prevents 10…0-0. White must in fact use the original g-knight to remove the pawn on d7 (in just three moves) – and sacrifice the piece there – so as to facilitate Black’s development. 1.Nf3 Nc6 2.Ne5 Nd4 3.Nxd7 Nf3+ 4.exf3 Nf6 5.Bb5 Nxd7 6.d3 f6 7.Bh6 gxh6 8.Nc3 Bg7 9.Ne2 0-0 10.Ng1 Nb8. Hence both White and Black execute the Sibling theme.
In the Gukesh-Ding game, both white knights are still on the board in the curious position where they have swapped sides. This raises the question of whether there are piece-switching proof games that resemble such a situation more closely – that is, both knights of a player are still present but they have finished up on the original squares of each other. This difficult effect, even more paradoxical than the Sibling theme, has indeed been accomplished a number of times. Below is a great example where the black knights play the principal roles.
The white units that are shifted from their home squares have used up all 12 moves available. The rook from a1 in particular took four moves, Rc1-c3-f3-f6 – a route that precludes an early Pf4 (not Rd1-d6-f6 because of the obstructing d2-knight). White’s missing d-pawn was thus captured unmoved; Black must use the g-knight to remove it quickly and release White’s queen-side pieces. 1.c4 Nf6 2.Qa4 Ne4 3.Qc6 Nxd2 4.e4. After 4…Nb3 (avoiding a check on f3) 5.Bh6, White’s remaining sequence is strictly determined regardless of what Black does. And since the eventual rook move to f6 will hamper access to g8 by a knight, Black has to prioritise a knight trek to that original square. Now if we choose the knight on b3 for this trip, its quickest route will still cause a traffic jam on f6, e.g. 5…Nd4 6.Nd2 Nf5 7.Rc1 Ne3 8.Rc3 Nd5 9.Rf3 Nf6 10.Rxf6?? Therefore the b8-knight has to take over the job, being able to reach f6 faster. 5…Na6 6.Nd2 Nb4 7.Rc1 Nd5 8.Rc3 Nf6 9.Rf3 Ng8 10.Rf6. There’s just time left for the b3-knight to move to b8 and complete the switch of the two black pieces. 10…Nc5 11.f4 Na6 12.Ngf3 Nb8. Of all the proof games achieving this exchange-of-places theme, this one is perhaps the most elegant. Not only does the diagram position present an eye-catching initial array for Black, but the game is also very economical, both in length (12 moves only) and in the number of captures (just a pawn missing).
