The most beautiful puzzle that my engine can never solve

Sort:
drdos7

Post #16 is a mate in 26 (or less):

drdos7

Here is another study where Stockfish is absolutely helpless (along with other engines), and has no clue as to the solution:

White to play and WIN:

Lent_Barsen
drdos7 wrote:

Have a real one that engines can't solve:

"Can't solve" seems to be a bit of an overstatement. In my test Stockfish finds all the correct moves for white but takes until a few moves in to realize white is winning. One can then back it up to the start and it will "remember" that it has a winning position (in its evaluation.)

Given a long enough think time, or fast enough hardware, I think it would evaluate white as winning from the start.

[edit] also props to the OP for finding a sort of click baitee title to boost engagement: "engine can never solve" happy

chinoi321
drdos7 wrote:

Here is another study where Stockfish is absolutely helpless (along with other engines), and has no clue as to the solution:

White to play and WIN:

nice puzzle

KingGay2000

Hi i got check mate and the computer told me it was the wrong move so idk if it is such a bad puzzle

KingGay2000

i meant to write beautifull instead of bad sorry

KingGay2000

After the 7th move ke3

drdos7
Lent_Barsen wrote:
drdos7 wrote:

Have a real one that engines can't solve:

"Can't solve" seems to be a bit of an overstatement. In my test Stockfish finds all the correct moves for white but takes until a few moves in to realize white is winning. One can then back it up to the start and it will "remember" that it has a winning position (in its evaluation.)

Given a long enough think time, or fast enough hardware, I think it would evaluate white as winning from the start.

[edit] also props to the OP for finding a sort of click baitee title to boost engagement: "engine can never solve"

Well of course if you feed Stockfish the moves it will eventually see that white is winning, but Stockfish WILL not see the second move (2.Qxc7+!) on any hardware, it DOES NOT see the Queen sac on the second move at the square c7. I have a 20 core machine and it doesn't find the second move even if I let it think in infinite mode for several hours.

Here is Stockfish 16 after 2 hours trying to find the second move using 20 threads and a 16GB hash table, and still no dice showing a draw score of 0.00 after 214 billion nodes searched:

Lent_Barsen
Well of course if you feed Stockfish the moves it will eventually see that white is winning, 

That's not what I did. I put Stockfish into analysis mode and then played its moves as white against your solution moves as black, and it found Qxc7+. It still evaluated 0.00 until some moves down the road when it decided white was winning, and then when I backed it up to the beginning it maintained that white was winning all along.

I was not able to replicate it when I tried it again today, so I'm not sure what happened there.

One thing I'd say on a more meta level though is that of course Stockfish can solve this. Any engine can solve this. It's just a matter of the horizon effect, not a fundamental incapability.

drdos7
Lent_Barsen wrote:
Well of course if you feed Stockfish the moves it will eventually see that white is winning, 

That's not what I did. I put Stockfish into analysis mode and then played its moves as white against your solution moves as black, and it found Qxc7+. It still evaluated 0.00 until some moves down the road when it decided white was winning, and then when I backed it up to the beginning it maintained that white was winning all along.

I was not able to replicate it when I tried it again today, so I'm not sure what happened there.

One thing I'd say on a more meta level though is that of course Stockfish can solve this. Any engine can solve this. It's just a matter of the horizon effect, not a fundamental incapability.

Well, you'll have to forgive me if I'm a bit skeptical about Stockfish finding 2.Qxc7+! because it has NEVER found it on my 20 core system, also when you "back it up" the correct moves and evaluation are stored in the hash table so of course it's going to see that white is winning, and I maintain that Stockfish cannot solve this no matter what the horizon.

Here's another one it can't solve:

removedusername8329742834

No I know why the cheaters in puzzles don't get 100%^^

chinoi321
Lent_Barsen wrote:
Well of course if you feed Stockfish the moves it will eventually see that white is winning, 

That's not what I did. I put Stockfish into analysis mode and then played its moves as white against your solution moves as black, and it found Qxc7+. It still evaluated 0.00 until some moves down the road when it decided white was winning, and then when I backed it up to the beginning it maintained that white was winning all along.

I was not able to replicate it when I tried it again today, so I'm not sure what happened there.

One thing I'd say on a more meta level though is that of course Stockfish can solve this. Any engine can solve this. It's just a matter of the horizon effect, not a fundamental incapability.

These engines could not solve the puzzle , to explain it professionally , just because there are not updated the programs which have ability to trapp queen and use zugwang to win material . To update this program , need lots of money and energy , that is why the vast majority of engines currently do not have this program installed . Of course , these engines can't solve the puzzle .

chinoi321
Grab_her_by_the_pawn wrote:

No I know why the cheaters in puzzles don't get 100%^^

Make sure that most of cheaters can't get his first move correctly in these types of puzzle .

Lent_Barsen
These engines could not solve the puzzle , to explain it professionally , just because there are not updated the programs which have ability to trapp queen and use zugwang to win material . To update this program , need lots of money and energy , that is why the vast majority of engines currently do not have this program installed . Of course , these engines can't solve the puzzle .

If there are puzzles that engines just fundamentally cannot solve, and the limitation is not due to the Horizon Effect, then it seems likely there should be some unsolvable puzzles where the solution doesn't run 40 or 60 ply deep. Any 10 ply examples?

Arisktotle
Lent_Barsen wrote:

If there are puzzles that engines just fundamentally cannot solve, and the limitation is not due to the Horizon Effect, then it seems likely there should be some unsolvable puzzles where the solution doesn't run 40 or 60 ply deep. Any 10 ply examples?

The limitation is always due to the Horizon effect. Having accepted that fact, the designers of engine software have added heuristic and neural network strategies which are inherently imperfect. But even the simplest engine software could solve every chess puzzle by backward induction if not restricted by the speed of its CPU cores - what we know as Horizon.

drdos7
Lent_Barsen wrote:
These engines could not solve the puzzle , to explain it professionally , just because there are not updated the programs which have ability to trapp queen and use zugwang to win material . To update this program , need lots of money and energy , that is why the vast majority of engines currently do not have this program installed . Of course , these engines can't solve the puzzle .

If there are puzzles that engines just fundamentally cannot solve, and the limitation is not due to the Horizon Effect, then it seems likely there should be some unsolvable puzzles where the solution doesn't run 40 or 60 ply deep. Any 10 ply examples?

Try this Mate in 5 that Stockfish struggles with, and remember this isn't white to play and win, it is a mate in 5 (not a mate in 22 or 15 or 7):

Elroch

I believe the Stockfish algorithms would, in principle, play perfect chess given unlimited computing and memory. This is because if it continued to grow the analysis tree, eventually it would be complete, and its choice would be game theoretic optimal. This is impossible in practice because of the vast time and memory needed.

Elroch
DesperateKingWalk wrote:
Elroch wrote:

I believe the Stockfish algorithms would, in principle, play perfect chess given unlimited computing and memory. This is because if it continued to grow the analysis tree, eventually it would be complete, and its choice would be game theoretic optimal. This is impossible in practice because of the vast time and memory needed.

You believe wrong.

Again Stockfish is a TYPE B Shannon chess engine. And is always pruning almost all moves in a chess position. No matter how much time and memory.

This is wrong. You are claiming that it stops analysing when it only sees relatively unappealing moves that have not been exhaustively analysed. It does not, given adequate resources. 

  1. It continues to analyse more nodes, taking a finite time for each
  2. There are a finite number of nodes
  3. Thus, in principle, it would complete the task in finite time with unlimited memory

Again, a type B chess engine, and Stockfish is a type B chess engine. Is not designed to solve every chess positions. And it not able to solve them. Because it was not designed to solve them.

See above to learn something simple but new.

Note this is about the algorithms, not a 64-bit implementation that is limited to 16 million terabytes of RAM. But only implementation details would need to change, not algorithmic ones.

drdos7
DesperateKingWalk wrote:
A chess engine that is designed to look at every move. Easily solves this mate in 5 posted earlier. In less then 1 second. 
 

WinCHEST Ver.3.19i+, 08-Mar-2011
Options = -M2044 -Z5 -11 -el -U -C16 -K1 -P4 -X20 -0 -5 -rS
Input file: STDIN
Reading job:
% created by ChestUCI Ver.5.2
W: Kb1 Re3 Bb2 Nc7 Ng2 Pa3 Pb4 Pc3 Pd2 Pf4 Ph4 (11)
B: Kg4 Re5 Bd7 Pa6 Pb6 Pb3 Pc4 Pd3 Pe4 Pf5 Ph5 (11)
FEN: 8/2Nb4/pp6/4rp1p/1Pp1pPkP/PpPpR3/1B1P2N1/1K6 w - -
analysing (first special-mate in 5 moves):
Solution (in 5 moves):
b1c1
Time (virt) = 0.040 sec

PV= b1c1 b6b5 c1d1 a6a5 d1e1 a5a4 e1f2 d7e8 e3g3
 b1c1 a6a5 c1d1 ...+3
b6b5 c1d1 ...+3
d7a4 c1d1 ...+3
d7b5 c1d1 ...+3
d7c6 c1d1 ...+3
d7c8 c1d1 ...+3
d7e8 c1d1 ...+3
e5a5 c1d1 ...+3
e5b5 c1d1 ...+3
e5c5 c1d1 ...+3
e5e6 c1d1 ...+3
e5e7 c1d1 ...+3
e5e8 c1d1 ...+3
d7e6 c7e8 ...+1
e5d5 c7d5 ...+1

end of solution tree (no duals except at top)
Total Time (virt) = 0.041 sec

Correct Mark, but Stockfish 16 doesn't see it (most people don't get the developement versions) and I doubt that Dragon does either even though I don't own it, and the guy I was giving this position to asked for a 10 ply that engines like Stockfish won't solve rather than a mate finder that can't play a game of chess like WinCHEST (unless of course some day it finds a forced mate from the starting position grin, which if the game is a draw from the starting position then that would be impossible).

drdos7
DesperateKingWalk wrote:
drdos7 wrote:
DesperateKingWalk wrote:
A chess engine that is designed to look at every move. Easily solves this mate in 5 posted earlier. In less then 1 second. 
 

WinCHEST Ver.3.19i+, 08-Mar-2011
Options = -M2044 -Z5 -11 -el -U -C16 -K1 -P4 -X20 -0 -5 -rS
Input file: STDIN
Reading job:
% created by ChestUCI Ver.5.2
W: Kb1 Re3 Bb2 Nc7 Ng2 Pa3 Pb4 Pc3 Pd2 Pf4 Ph4 (11)
B: Kg4 Re5 Bd7 Pa6 Pb6 Pb3 Pc4 Pd3 Pe4 Pf5 Ph5 (11)
FEN: 8/2Nb4/pp6/4rp1p/1Pp1pPkP/PpPpR3/1B1P2N1/1K6 w - -
analysing (first special-mate in 5 moves):
Solution (in 5 moves):
b1c1
Time (virt) = 0.040 sec

PV= b1c1 b6b5 c1d1 a6a5 d1e1 a5a4 e1f2 d7e8 e3g3
 b1c1 a6a5 c1d1 ...+3
b6b5 c1d1 ...+3
d7a4 c1d1 ...+3
d7b5 c1d1 ...+3
d7c6 c1d1 ...+3
d7c8 c1d1 ...+3
d7e8 c1d1 ...+3
e5a5 c1d1 ...+3
e5b5 c1d1 ...+3
e5c5 c1d1 ...+3
e5e6 c1d1 ...+3
e5e7 c1d1 ...+3
e5e8 c1d1 ...+3
d7e6 c7e8 ...+1
e5d5 c7d5 ...+1

end of solution tree (no duals except at top)
Total Time (virt) = 0.041 sec

Correct Mark, but Stockfish doesn't see it and I doubt that Dragon does either even though I don't own it, and the guy I was giving this position to asked for a 10 ply that engines like Stockfish won't solve rather than a mate finder that can't play a game of chess like WinCHEST (unless of course some day it finds a forced mate from the starting position , which if the game is a draw from the starting position then that would be impossible).

Read the post. I already showed that Stockfish finds the mate in 5.

The latest Stockfish does not struggle with this mate in 5.

Line 0.0
8/2Nb4/pp6/4rp1p/1Pp1pPkP/PpPpR3/1B1P2N1/1K6 w - - 0 1

Analysis by Stockfish dev-20230824-4c4cb185:

1.Kc1 a5 2.Kd1 axb4 3.Ke1 bxa3 4.Kf2 axb2 5.Rg3#
 Depth: 245/10 00:02:42 3686MN, tb=19348
 White mates.

(, 02.09.2023)

I edited mine to read Stockfish 16 doesn't solve it.