The hardest endgame of all time
so this is as far as I got from my own but with one move of assistance I did it from here
Nunn covered this B+N v N ending briefly in Secrets of Minor Piece Endings. He gave a few examples where the material arises from B+P v N, where the P must promote to a N in order to win. Even the simpler examples, composed by humans, are hard to understand, though Nunn provided a few pointers on the general winning method. He finished with a tablebase-generated position, which he called the most complex in the whole book, and that it's "beyond human ability to solve or check for soundness".
https://syzygy-tables.info/?fen=8/8/2P5/1n5k/5K2/8/1B6/8_w_-_-_0_1
It takes more than 50 moves to win, and the solution begins with 1.Kf5 Na7 2.c7 Nb5 3.c8=N!
Nunn covered this B+N v N ending briefly in Secrets of Minor Piece Endings. He gave a few examples where the material arises from B+P v N, where the P must promote to a N in order to win. Even the simpler examples, composed by humans, are hard to understand, though Nunn provided a few pointers on the general winning method. He finished with a tablebase-generated position, which he called the most complex in the whole book, and that it's "beyond human ability to solve or check for soundness".
https://syzygy-tables.info/?fen=8/8/2P5/1n5k/5K2/8/1B6/8_w_-_-_0_1
It takes more than 50 moves to win, and the solution begins with 1.Kf5 Na7 2.c7 Nb5 3.c8=N!
That’s a REALLY optimal version, that knight can be won pretty easily because it’s already so limited
That’s a REALLY optimal version, that knight can be won pretty easily because it’s already so limited
It actually takes 53 moves to win the knight (just in time under the 50-move rule, because the count starts after the promotion on move 3). If you can prove Nunn-armed-with-tablebases wrong, I'd love to see it. ![]()
That’s a REALLY optimal version, that knight can be won pretty easily because it’s already so limited
It actually takes 53 moves to win the knight (just in time under the 50-move rule, because the count starts after the promotion on move 3). If you can prove Nunn-armed-with-tablebases wrong, I'd love to see it.
REALLY?
Ok the knight escapes to c7
And white STILL WINS?!!
That’s a REALLY optimal version, that knight can be won pretty easily because it’s already so limited
It actually takes 53 moves to win the knight (just in time under the 50-move rule, because the count starts after the promotion on move 3). If you can prove Nunn-armed-with-tablebases wrong, I'd love to see it.
REALLY?
Ok the knight escapes to c7
And white STILL WINS?!!
Yes, the Syzygy tablebase I linked shows that after 1.Kf5 Nc7, White has a relatively quick win, because a queen promotion can't be stopped. But 1...Na7! requires White to promote to a knight in order to win, and that's the ridiculously complex variation analysed by Nunn.
That’s a REALLY optimal version, that knight can be won pretty easily because it’s already so limited
It actually takes 53 moves to win the knight (just in time under the 50-move rule, because the count starts after the promotion on move 3). If you can prove Nunn-armed-with-tablebases wrong, I'd love to see it.
REALLY?
Ok the knight escapes to c7
And white STILL WINS?!!
Yes, the Syzygy tablebase I linked shows that after 1.Kf5 Nc7, White has a relatively quick win, because a queen promotion can't be stopped. But 1...Na7! requires White to promote to a knight in order to win, and that's the ridiculously complex variation analysed by Nunn.
I actually meant Nc7 on move 3, not on move 1
I actually meant Nc7 on move 3, not on move 1
Um, 3...Nc7 loses to 4.Ne7 according to Syzygy. Since your first post mentioned tablebases, I assumed you knew how to look up such best play info.
I actually meant Nc7 on move 3, not on move 1
Um, 3...Nc7 loses to 4.Ne7 according to Syzygy. Since your first post mentioned tablebases, I assumed you knew how to look up such best play info.
i have access to a tablebase but i dont always check it
https://www.chess.com/analysis/game/pgn/36J6fCPTRY
The game I played using tablebases. Hope I won't get banned because of that.
https://www.chess.com/analysis/game/pgn/36J6fCPTRY
The game I played using tablebases. Hope I won't get banned because of that.
Banned.
https://www.chess.com/analysis/game/pgn/36J6fCPTRY
The game I played using tablebases. Hope I won't get banned because of that.
Banned.
It was only against computer in a unrated game for experiment, it's not cheating to get cheap rating.
I really don't get the confusion. Am I missing anything? it seems easy. the king can't run as long as the Bishop remains in that diagonal. Ng3 is the mating move. the only worry is when the Black Knight goes to f5 preventing the mate. But if you just move around your Bishop along the diagonal, black still has to move the Knight again. and then it is mate.
I really don't get the confusion. Am I missing anything? it seems easy. the king can't run as long as the Bishop remains in that diagonal. Ng3 is the mating move. the only worry is when the Black Knight goes to f5 preventing the mate. But if you just move around your Bishop along the diagonal, black still has to move the Knight again. and then it is mate.
The knight will move to e4, and if you wait it will check on f2/g5