New answers tagged

0



7

A solution in 16.5 moves exists, created by Italian composer G. Ponzetto in 2000. I found it being posted by user @AussieRookie in this chess.com thread:


6

You can do it in


8

13 moves: 12½:


7

Here's a not-really-optimized solution, 14 moves:


1

Same basic idea as Barsloai, but refined a bit to actually achieve mate in 19. All of black's lines should be accounted for.


2

More direct, visual reasoning for all of the knight-variants, using Camel as the example:


7

I'm pretty sure it is Reasoning: This is indeed possible:


7

I'm gonna go with The latter depends on the following characteristics of the move: there are 8 different squares to block any square you can reach in 1 move is impossible to reach in 2 moves if you can reach a square in 1 move, there are several ways to reach it in 3 moves.


3



1

There are even some games like this, such as Hodgeson v Agdestein, London 1986. This example is in Martin Weteschnik's wonderful book Understanding Chess Tactics. There's some clever tactics going on, but this is the last few moves of the game which ended in this way:


2

I wrote a program to solve this. I found 15 solutions. Here are two of them. As the solution should be unique, I tried to hunt for violation of the rules. But I could not found any.


Top 50 recent answers are included