English Chess Forum

My son was so excited that he solved this study that I thought I'd share it here.
As I understand, even engines can't crack it (I tried on Stockfish and Leela and they failed), and it would appear that some 80's super GMs couldn't solve until Tal found the answer.

[Variant "From Position"] [FEN "8/3P3k/n2K3p/2p3n1/1b4N1/2p1p1P1/8/3B4 w - - 0 1"]
White to play.

I see the idea and I know where the Kings are at the end. I think there is a general clue to the answer if you consider why each White piece has made it onto the board

I could half-remember this so I was sure I'd seen it elsewhere. The solution is at https://www.chess.com/article/view/the- ... ess-puzzle [and doubtless other places too] with the main line running to 11 moves so your son did well to solve it.

What I found fascinating was that the computer engines still have blind spots.

In SF's case its a purposeful choice to limit their search space to make them stronger in real games. There's probably some way to force it to do a more exhaustive search than usual which would let it solve the puzzle.
(Really old engines definitely had this, no idea if it has survived.).

Leela is far too human to have a chance

Dutch endgame composer Gijs van Breukelen.
There is a ChessBase article.
https://en.chessbase.com/post/solution- ... able-study