-1

I know this type of question has been asked a few times but each of the puzzles in the answers are solved by engines. For example Plaskett’s puzzle and other common ones such as Mitrofanov deflection and Mario Matous’ mate in 13 can be seen by matefinders easily. Are there any puzzles that truly stump engines?

Improve this question
1
  • 1
    The truth is, every puzzle is solvable by computer.
    – user26887
    Commented Aug 17, 2021 at 19:30

1 Answer 1

Reset to default
-1

Usually, swindles and those sort of puzzles stump engines because practically the best chance of winning is variation A, but the computer prefers variation B because it has a different calculation system to us. Those are usually the hardest for computers and they usually get them wrong, even if it is technically correct.

Improve this answer
2
  • I found this interesting but the answer would be more compelling if it added a few example positions.
    – SecretAgentMan
    Commented Aug 19, 2021 at 13:24
  • Marshall's swindles is an example but the course on chessable has many examples.
    – blunderchess1236
    Commented Aug 25, 2021 at 5:49

Not the answer you're looking for? Browse other questions tagged or ask your own question.