Answers.Body: <p>I am running SCID on the front and Stockfish 6 on the back. Stockfish is running on 4 cores with a gigabyte of RAM. The computer is an Intel quad-core 3.2GHz i5, 16Gb of RAM, 64-bit OS.</p>
  
  <p>I am not using a tablebase. I am not sure it matters; the first move or two are the hard ones.</p>
  
  <pre>
  <code>
  [title "Behting study and Stockfish 6"]
  [fen "8/8/7p/3KNN1k/2p4p/8/3P2p1/8 w - - 0 1"]
  
  1.Kc6 g1=Q 2.Nxh4 Qa1 3.Nhf3 Qa5 4.Kd6 Qa2 5.Kc5 Qb3 6.Kd4 Qb4 7.Kd5 c3 8.dxc3 Qxc3 9.Ke4 Qc5 10.Kd3 Qd5+ 11.Ke3 Qd1 12.Ke4 Qb1+ 13.Ke3 Qc1+ 14.Kd4 Qf4+ 15.Kd3 Qa4 16.Ke3 Qc2 17.Kd4 Qe2 18.Kd5 Qb5+ 19.Ke4 Qb7+ 20.Kd4 Qc7 21.Ke4 Qb6 22.Kd3 Qa6+ 23.Ke3 Qa3+ 24.Ke4 Qf8 25.Ke3 Qb4 26.Kd3 Qf4 27.Ke2 Qf5 28.Ke3 Qf8 29.Ke4 Qc8 30.Kd5 Qa8+ 31.Kd4 Qb7 32.Ke3 Qd5 33.Kf4 Qb7
  </code>
  </pre>
  
  <p>I think the "no computer can solve this" comment is very dated... the person who said it mentioned Anatoly Karpov...</p>
  
  <p>And as requested (rudely), here's a screen shot.</p>
  
  <p><a href="https://i.sstatic.net/CVOhR.png" rel="nofollow noreferrer"><img src="https://i.sstatic.net/CVOhR.png" alt="Behting study; screencap of Stockfish 6&#39;s analysis"></a></p>
  
Answers.ContentLicense: CC BY-SA 3.0
Answers.CreationDate: 2015-12-31T05:23:50.520Z
Answers.Text: The lines at the top are the first lines it tried. Each line further down reflects a refinement. As you read down, you'll see it find `Kc6`, then try `Ng7`, then go back the `Kc6`.  There it will stay.
Answers.UserDisplayName: Tony Ennis
Answers.ContentLicense: CC BY-SA 3.0
Answers.CreationDate: 2015-12-31T05:33:47.770Z
Answers.Text: The engine won't rate the position as 0 for this type of draw. While we know it is a draw, Stockfish is dutifully searching for a solution. Even if it knows the 50 move rule, it will have _countless_ alternatives. Since it has what ought to be a decisive material advantage, I doubt a draw will make it happy. It's going to search a long long time.  I don't know what the depth is at the time of the screenshot. The analysis snipped is indicative of what it was doing, however.
Answers.UserDisplayName: Tony Ennis
Answers.ContentLicense: CC BY-SA 3.0
Answers.CreationDate: 2015-12-31T05:11:41.070Z
Answers.LastActivityDate: 2015-12-31T05:18:48.070Z
Answers.LastEditDate: 2015-12-31T05:18:48.070Z
Answers.UserDisplayName: Tony Ennis
Answers.Body: <p>According to this post by u/dangi12012-1, <a href="https://www.reddit.com/r/chess/comments/lhmp8a/behting_study_cracked_by_stockfish_at_depth_70/" rel="nofollow noreferrer">Behting Study Cracked by Stockfish at depth 70!</a>, Stockfish 12 NNUE evaluated 0.00 after 25 minutes with a powerful 16-core AMD Ryzen 3950X and 58 GB hash.</p>
  <p>The post has the full info but here is the final PV:</p>
  <pre><code>info depth 72 seldepth 23 multipv 1 score cp 0 nodes 459232159581 nps 102464614 hashfull 426 tbhits 0 time 4481861 pv d5c6 g2g1q f5h4 g1a7 h4f3 a7a6 c6c5 c4c3 d2c3 a6a7 c5d6 a7a3 d6e6 a3c3 e6d5 c3c8 d5e4 c8h3 e4d5 h3g3 d5e4
  </code></pre>
  <p>After 1. Kc6 g1=Q, Stockfish 14 on Lichess analysis board considers it a draw, but then reconsiders and puts it at -2.5. After dxc3 this is a <a href="https://syzygy-tables.info/?fen=8/8/q6p/2K1N2k/8/2P2N2/8/8_b_-_-_0_1" rel="nofollow noreferrer">7-piece tablebase draw</a> but Lichess analysis doesn't have that.</p>
  <pre><code>[Title &quot;Stockfish 12 NNUE at depth 72&quot;]
  [FEN &quot;8/8/7p/3KNN1k/2p4p/8/3P2p1/8 w - - 0 1&quot;]
  
  1. Kc6 g1=Q 2. Nxh4 Qa7 3. Nhf3 Qa6+ 4. Kc5 c3 5. dxc3 Qa7+ 6. Kd6 Qa3+ 7. Ke6 Qxc3 8. Kd5 Qc8 9. Ke4 Qh3 10. Kd5 Qg3 11. Ke4
  </code></pre>
  <hr />
  <p>For what it's worth, I tried it out on my own relatively modest laptop with i7-7700HQ, 8 cores, 16 GB hash and Stockfish 15 NNUE for about 40 minutes and it still gave -4.65 eval, after 18 billion nodes instead of 459 billion. Probably would've benefited a lot from a 7-piece tablebase, or even just the 6-piece one.</p>
  <pre><code>info depth 69 seldepth 130 multipv 1 score cp -456 nodes 18878194760 nps 8098927 hashfull 691 tbhits 0 time 2330950 pv f5g7 h5g5 e5f3 g5g4 d5e4 h4h3 g7f5 g2g1q f3g1 h3h2 f5h6 g4h5 g1f3 h2h1q h6f5 h5g4 f5e3 g4g3 e3f5 g3f2 f5d4 h1h7 e4d5 h7c7 f3e5 c7a5 d5e4 a5a2 e5g4 f2e1 d4f3 e1e2 g4e5 a2a6 e4d5 a6b5 d5d4 e2f2 d4e4 b5b7 e4d4 f2g3 d4c4 g3f4 c4c5 b7a6 c5d5 a6a5 d5d6 a5d8 d6c5 f4e4 d2d3 e4f4 c5c6 d8f6 c6d5 f6b6 d3d4 b6b3 d5d6 b3a3 d6e6 a3a6 e6d5 a6b6 f3h4 b6d8 d5e6 d8d4 e5g6 f4e4 e6e7 d4a7 e7f6 a7f2 f6e6 f2e3 e6e7 e3e2 e7f7 e2f1 f7e7 e4d5 h4g2 f1a1 g2f4 d5e4 f4e6 a1a7 e7f6 a7f2 f6e7 e4f5 g6f8 f2e3 e7d6 e3d3 d6c6 d3d2 e6c5 d2h6 c5e6 f5e5 c6c7 h6e3 c7c6 e3f3 c6d7 f3f7 d7c6 f7e8 c6c7
  </code></pre>
  <p>The current PGN viewer at move 11 doesn't recognize in a valid PGN that Nd4 can only refer to one knight, so move 11 has to be written out.</p>
  <pre><code>[title &quot;Stockfish 15 NNUE at depth 69&quot;]
  [fen &quot;8/8/7p/3KNN1k/2p4p/8/3P2p1/8 w - - 0 1&quot;]
  
  
  1. Ng7+ Kg5 2. Nf3+ Kg4 3. Ke4 h3 4. Nf5 g1=Q 5. Nxg1 h2 6. Nxh6+ Kh5 7. Nf3 h1=Q 8. Nf5 Kg4 9. Ne3+ Kg3 10. Nf5+ Kf2 11. Nf5d4 Qh7+ 12. Kd5 Qc7 13. Ne5 Qa5+ 14. Ke4 Qa2 15. Ng4+ Ke1 16. Nf3+ Ke2 17. Nge5 Qa6 18. Kd5 Qb5+ 19. Kd4 Kf2 20. Ke4 Qb7+ 21. Kd4 Kg3 22. Kxc4 Kf4 23. Kc5 Qa6 24. Kd5 Qa5+ 25. Kd6 Qd8+ 26. Kc5 Ke4 27. d3+ Kf4 28. Kc6 Qf6+ 29. Kd5 Qb6 30. d4 Qb3+ 31. Kd6 Qa3+ 32. Ke6 Qa6+ 33. Kd5 Qb6 34. Nh4 Qd8+ 35. Ke6 Qxd4
  </code></pre>
  <p>Now, do you count engines using tablebases as solving the study? Stockfish with just the 5-man tablebase (a couple hundred megabytes of relevant files) is able to compute a draw in a few minutes. The eval quickly neutralizes from -4 to 0.0 around depth 45 and stays there for increased depth (tested up to 72).</p>
  <pre><code>info depth 45 seldepth 54 multipv 1 score cp 0 nodes 2418702985 nps 8967492 hashfull 60 tbhits 3503813 time 269719 pv d5c6 g2g1q f5h4 g1a1 h4f3 a1a8 c6c5 a8a3 c5c4 a3d6 d2d4 d6a6 c4c5 a6e6 d4d5 e6c8 c5d4 c8c7 d5d6 c7d6 d4e4 d6c5 e4d3 c5f2 d3e4 f2e2 e4f4 e2c2 f4g3 c2a4 g3h2 a4f4 h2g2 f4e3 g2g3 e3b3
  </code></pre>
  <p>I also left <a href="https://www.chessprogramming.org/Crystal" rel="nofollow noreferrer">Crystal</a>, a Stockfish derivative designed to solve chess problems, on overnight, but it computes depth much slower than stockfish and didn't solve the study.</p>
  <pre><code>info depth 57 seldepth 118 multipv 1 score cp -245 nodes 9016985399 nps 9322203 hashfull 519 tbhits 0 time 967259 pv f5g7 h5g5 e5f3 g5g4 g7f5 h4h3 d5e4 g2g1q f3g1 h3h2 f5h6 g4h5 g1f3 h2h1q h6f5 h5g4 f5e3 g4g3 e3f5 g3g2 e4e3 h1c1 f5d4 c1a3 e3f4 a3b4 f4e3 b4b8 f3h4 g2g3 h4f5 g3h3 d4f3 h3g2 f5d4 b8e8 e3f4 e8h5 f4e3 h5d5 f3e1 g2g3 e1f3 d5c5 e3e4 c5h5 d4f5 g3f2 f5d4 h5h1 e4d5 f2g3 d5c4 h1f1 c4d5 g3f4 f3e5 f1g2 d4f3 g2g8 d5d4 g8b3 d4c5 b3a3 c5d5 a3a2 d5d4 a2b2 d4d5 b2b6 d2d3 b6d8 d5e6 d8a5 e6d6 a5b4 d6e6 b4c5 d3d4 c5b6 e6d5 b6b3 d5d6 b3b8 d6c5 b8a7 c5d6 a7a6 d6d5 a6b6 f3h4 b6a5 d5e6 f4e4 e6e7 a5c7 e7e6 c7d8 e5g6 d8b6 e6f7 b6d4 f7e7 d4f2 e7e6 f2f1 e6e7 e4d5 h4g2 f1f2 g2f4 d5e4 f4e6 f2a7 e7f6
  </code></pre>
  
Answers.ContentLicense: CC BY-SA 4.0
Answers.CreationDate: 2022-09-19T04:35:21.103Z
Answers.LastActivityDate: 2022-10-13T20:02:04.160Z
Answers.LastEditDate: 2022-10-13T20:02:04.160Z
Answers.UserDisplayName: qwr
Answers.Body: <p>This has turned into a hot discussion... I take it positively because we need more traffic.</p>
  
  <p>I'm confident all the well written engines will give Kc6 with sufficient thinking time. That's because all other alternatives are even worse. The line starting with Kc6 is the only line that the computer finds with 2 knights vs queen. Everything else results in further material loss and therefore discarded.</p>
  
  <p>Since the engine is able to see Kc6 would be the only move not losing instantly, the puzzle should be considered solved.</p>
  
  <p>It's insane for the Stockfish engine to give a 0.00 score in this kind of position because it is simply not designed for something like this.</p>
  
Answers.ContentLicense: CC BY-SA 3.0
Answers.CreationDate: 2016-01-01T14:55:01.953Z
Answers.LastActivityDate: 2016-01-01T14:55:01.953Z
Answers.UserDisplayName: SmallChess
Answers.Body: <p>For the record, the soundness of the Behting study has been under a cloud for some time because it is not easy to refute 1 Ng7+ Kg5 2 Nf3+ Kg4 3 Kf5 h3 4 Ke4 g1Q 5 Nxh6+ Kh5 6 Nxg1 h2 7 Nf3 h1Q 8 Nf5 &quot;etc.&quot;, but according to <a href="http://en.chessbase.com/post/john-nunn-the-behting-study-is-sound" rel="nofollow noreferrer">recent analysis by GM John Nunn</a> (2012) the study is sound after all.</p>
  <p>It should be feasible for a chess engine to reach a 0.00 evaluation because there are only a few thousand drawing positions that need to be evaluated (depending on wK/bQ position, with or without the c/d pawns), and once the search has exhausted that space they'll all evaluate to a draw.</p>
  <p>Here's a similar challenge:</p>
  <pre><code>[Title &quot;NDE 1986 (2nd Prize, Israel Ring 1986)&quot;]
  [fen &quot;5k2/1n6/1p3K2/P7/1P2N3/p1P2B2/8/2b5 w - - 0 0&quot;]
  </code></pre>
  <p><strong>White to move and draw.</strong></p>
  <p><em>Solution:</em></p>
  <blockquote class="spoiler">
  <p> 1 a6 a2 2 axb7 Bf4 3 Ng5! Bb8! (a1Q 4 Ne6+ Kg8! 5 Nxf4 Qxc3+ 6 Kf5 and Black can't win; 3 . . . Bd6 4 Ne6+ Kg8 5 Nc7! Bxc7 6 Bd5+ draws.  So the Bishop crosses the critical square c7, which however White can exploit too:) 4 Nh7+! Ke8 5 Bc6+ Kd8 6 Ng5 Kc7 7 b5! a1Q (Kd6!? 8 Ne4+ Kc7 9 Ng5 repeating) 8 Nf7! positional draw.</p>
  </blockquote>
  
Answers.ContentLicense: CC BY-SA 3.0
Answers.CreationDate: 2016-01-02T11:42:42.527Z
Answers.Text: This is just like saying chess can be solved simply be going through all combinations. Furthermore, if the engine doesn't understand the 50-moves draw, there is no way the evaluation can ever drop to zero. The engine wouldn't have enough memory to store all possible searched possibility, thus it'll always give a winning advantage for Black.
Answers.UserDisplayName: SmallChess
Answers.ContentLicense: CC BY-SA 4.0
Answers.CreationDate: 2016-01-01T17:45:40.133Z
Answers.LastActivityDate: 2024-05-11T12:43:15.070Z
Answers.LastEditDate: 2024-05-11T12:43:15.070Z
Answers.UserDisplayName: Noam D. Elkies
Body: <p><a href="https://i.sstatic.net/DhPiJ.png" rel="nofollow noreferrer"><img src="https://i.sstatic.net/DhPiJ.png" alt="enter image description here" /></a></p>
  <p>This is the famous Behting study, first published in the magazine Bohemia in 1906, which is often used as a demonstration that computers can’t solve all positions.</p>
  <p>White to move and draw with a very elegant move.</p>
  <p>Spoiler:</p>
  <blockquote class="spoiler">
  <p> 1. Kc6!! g1=Q 2. Nxh4 Qh1+ 3. Nhf3</p>
  </blockquote>
  <p>Question is, is this study still beating engines?</p>
  <p><strong>Clarification:</strong> Suggesting best move, doesn't mean engine understands(or finds) the solution. Without evaluating it 0.00 or =/=, it doesn't mean it's solved. Actually, best move with -4.** means engine believes that best possible continuation for White is this move, with winning advantage for Black.</p>
  <p>Imagine you ask a question to someone about a chess position in which White has a move which is the best and draws. You ask, which move is the best and why, and you get an answer like this: &quot;Best chance is this move, but even if it's White's best chance, it looks losing&quot;. And you know that move draws. Would you accept this answer as correct answer? Definitely no.</p>
  <p><strong>I recommend to read:</strong></p>
  <ul>
  <li>A very instructive article about interpreting evaluations of chess engines: <a href="http://www.chess.com/blog/ChessMN16/how-to-read-engine-evaluations" rel="nofollow noreferrer">How to Read Engine Evaluations?</a></li>
  <li>This post: <a href="https://chess.stackexchange.com/questions/1720/computer-evaluations-how-trustworthy-are-they?rq=1">Computer evaluations: How trustworthy are they?</a></li>
  </ul>
  <p><strong>Notes about edits</strong>: As the question turned into a discussion about whether the position solved by engines or not, I revised the question accordingly.</p>
  <p>This question is totally about facts, and not opinion based. Some of the answers are opinion-based, but it's not the problem of the question. <strong>It's terribly wrong to close this question, instead of letting people discuss it.</strong></p>
  
Comments.ContentLicense: CC BY-SA 3.0
Comments.CreationDate: 2015-12-29T01:03:01.187Z
Comments.Text: I'm having a hard time believing engines can't solve it. To me, it seems much more plausible that the solution is flawed. Does it maybe involve Nh4: Kh4: instead of Nh4: g1=Q?
Comments.UserDisplayName: 11684
Comments.ContentLicense: CC BY-SA 3.0
Comments.CreationDate: 2015-12-29T05:57:52.007Z
Comments.Text: For those wanting to know the solution without emailing anyone (note: the following link contains spoilers), this position is a fairly well-known [study by Behting](http://en.chessbase.com/post/john-nunn-the-behting-study-is-sound).
Comments.UserDisplayName: ETD
Comments.ContentLicense: CC BY-SA 3.0
Comments.CreationDate: 2015-12-29T22:50:59.703Z
Comments.Text: Stockfish 6 solved this in just under 2 minutes. It isn't clear to me that Stockfish "knows" this is a draw, but it has reached 45 moves beyond the starting position.  It is now exploring a new 2nd move for Black.
Comments.UserDisplayName: Tony Ennis
Comments.ContentLicense: CC BY-SA 3.0
Comments.CreationDate: 2015-12-31T09:53:34.057Z
Comments.Text: Stockfish 6 chose the correct move when I tried it (from depth 43 to depth 56). I'm not using tablebases. I think Stockfish is non-deterministic when run with more than one thread (I'm using four), as the results presumably depend on the thread scheduling, which is unpredictable. In any case, the results certainly depend on how much hash memory you allocate it (I'm using 1024 MB).
Comments.UserDisplayName: Stephen
Comments.ContentLicense: CC BY-SA 4.0
Comments.CreationDate: 2022-09-24T06:26:36.660Z
Comments.Text: @ferit do you allow engines to use tablebases? Because top engines do use those.
Comments.UserDisplayName: qwr
Comments.ContentLicense: CC BY-SA 4.0
Comments.CreationDate: 2024-05-11T00:00:38.793Z
Comments.Text: *Actually, best move with -4. means engine believes that best possible continuation for White is this move, with winning advantage for Black* What makes you say -4 eval is winning?
Comments.UserDisplayName: Allure
Comments.ContentLicense: CC BY-SA 4.0
Comments.CreationDate: 2024-05-11T00:01:13.247Z
Comments.Text: Besides, if you take this idea - that only a 0.00 eval suggests the computer has "solved" it - then it's pretty easy to make a study that "beats computers". Here's one such position. 8/2k1p3/3pPp2/2pP1Pp1/1pP3Pp/pP5P/P2R1K2/1RRR4 w - - 0 1
Comments.UserDisplayName: Allure
Comments.ContentLicense: CC BY-SA 4.0
Comments.CreationDate: 2024-05-11T06:55:07.340Z
Comments.Text: @Allure It is worth noting, though, that an engine that can consistently find the correct moves in a given position can at modest additional computational cost be converted into one that correctly evaluates the position. One only has to let it play out some sample games to the end and collect statistics. This wouldn't be valuable for play, but would correctly evaluate examples such as this and many more difficult examples as long as the correct moves are at reasonable time controls among the top few moves considered by the engine.
Comments.UserDisplayName: Polytropos
Comments.ContentLicense: CC BY-SA 4.0
Comments.CreationDate: 2024-05-11T10:10:30.113Z
Comments.Text: I’m glad you fought off those who would have closed the question
Comments.UserDisplayName: Laska
Tags: <engines><problems>
Title: Is Behting Study Still Beating Computers?
ThreadText: # Is Behting Study Still Beating Computers?
  
  (Asked by: username_0 on 2015-12-29)
  
  [![enter image description here](https://i.sstatic.net/DhPiJ.png)](https://i.sstatic.net/DhPiJ.png)
  
  This is the famous Behting study, first published in the magazine Bohemia in 1906, which is often used as a demonstration that computers can’t solve all positions.
  
  White to move and draw with a very elegant move.
  
  Spoiler:
  
  > 1. Kc6!! g1=Q 2. Nxh4 Qh1+ 3. Nhf3
  
  Question is, is this study still beating engines?
  
  **Clarification:** Suggesting best move, doesn't mean engine understands(or finds) the solution. Without evaluating it 0.00 or =/=, it doesn't mean it's solved. Actually, best move with -4.\*\* means engine believes that best possible continuation for White is this move, with winning advantage for Black.
  
  Imagine you ask a question to someone about a chess position in which White has a move which is the best and draws. You ask, which move is the best and why, and you get an answer like this: "Best chance is this move, but even if it's White's best chance, it looks losing". And you know that move draws. Would you accept this answer as correct answer? Definitely no.
  
  **I recommend to read:**
  
  * A very instructive article about interpreting evaluations of chess engines: [How to Read Engine Evaluations?](http://www.chess.com/blog/ChessMN16/how-to-read-engine-evaluations)
  * This post: [Computer evaluations: How trustworthy are they?](https://chess.stackexchange.com/questions/1720/computer-evaluations-how-trustworthy-are-they?rq=1)
  
  **Notes about edits**: As the question turned into a discussion about whether the position solved by engines or not, I revised the question accordingly.
  
  This question is totally about facts, and not opinion based. Some of the answers are opinion-based, but it's not the problem of the question. **It's terribly wrong to close this question, instead of letting people discuss it.**
  
  **Tags:** engines, problems
  
  > **Comments:**
  > **username_1**: I'm having a hard time believing engines can't solve it. To me, it seems much more plausible that the solution is flawed. Does it maybe involve Nh4: Kh4: instead of Nh4: g1=Q?  
  > **username_2**: For those wanting to know the solution without emailing anyone (note: the following link contains spoilers), this position is a fairly well-known [study by Behting](http://en.chessbase.com/post/john-nunn-the-behting-study-is-sound).  
  > **username_3**: Stockfish 6 solved this in just under 2 minutes. It isn't clear to me that Stockfish "knows" this is a draw, but it has reached 45 moves beyond the starting position.  It is now exploring a new 2nd move for Black.  
  > **username_4**: Stockfish 6 chose the correct move when I tried it (from depth 43 to depth 56). I'm not using tablebases. I think Stockfish is non-deterministic when run with more than one thread (I'm using four), as the results presumably depend on the thread scheduling, which is unpredictable. In any case, the results certainly depend on how much hash memory you allocate it (I'm using 1024 MB).  
  > **username_5**: @username_0 do you allow engines to use tablebases? Because top engines do use those.  
  > **username_6**: *Actually, best move with -4. means engine believes that best possible continuation for White is this move, with winning advantage for Black* What makes you say -4 eval is winning?  
  > **username_6**: Besides, if you take this idea - that only a 0.00 eval suggests the computer has "solved" it - then it's pretty easy to make a study that "beats computers". Here's one such position. 8/2k1p3/3pPp2/2pP1Pp1/1pP3Pp/pP5P/P2R1K2/1RRR4 w - - 0 1  
  > **username_7**: @username_6 It is worth noting, though, that an engine that can consistently find the correct moves in a given position can at modest additional computational cost be converted into one that correctly evaluates the position. One only has to let it play out some sample games to the end and collect statistics. This wouldn't be valuable for play, but would correctly evaluate examples such as this and many more difficult examples as long as the correct moves are at reasonable time controls among the top few moves considered by the engine.  
  > **username_8**: I’m glad you fought off those who would have closed the question  
  
  ---
  
  ## 4 answers
  
  ### Answer by username_10 on 2016-01-01. Score: 7 | Accepted answer
  
  For the record, the soundness of the Behting study has been under a cloud for some time because it is not easy to refute 1 Ng7+ Kg5 2 Nf3+ Kg4 3 Kf5 h3 4 Ke4 g1Q 5 Nxh6+ Kh5 6 Nxg1 h2 7 Nf3 h1Q 8 Nf5 "etc.", but according to recent analysis by GM John Nunn (2012) the study is sound after all.
  It should be feasible for a chess engine to reach a 0.00 evaluation because there are only a few thousand drawing positions that need to be evaluated (depending on wK/bQ position, with or without the c/d pawns), and once the search has exhausted that space they'll all evaluate to a draw.
  Here's a similar challenge:
  [Title "NDE 1986 (2nd Prize, Israel Ring 1986)"]
  [fen "5k2/1n6/1p3K2/P7/1P2N3/p1P2B2/8/2b5 w - - 0 0"]
  
  White to move and draw.
  Solution:
  
   1 a6 a2 2 axb7 Bf4 3 Ng5! Bb8! (a1Q 4 Ne6+ Kg8! 5 Nxf4 Qxc3+ 6 Kf5 and Black can't win; 3 . . . Bd6 4 Ne6+ Kg8 5 Nc7! Bxc7 6 Bd5+ draws.  So the Bishop crosses the critical square c7, which however White can exploit too:) 4 Nh7+! Ke8 5 Bc6+ Kd8 6 Ng5 Kc7 7 b5! a1Q (Kd6!? 8 Ne4+ Kc7 9 Ng5 repeating) 8 Nf7! positional draw.
  
  > **Comments:**
  > **username_9**: This is just like saying chess can be solved simply be going through all combinations. Furthermore, if the engine doesn't understand the 50-moves draw, there is no way the evaluation can ever drop to zero. The engine wouldn't have enough memory to store all possible searched possibility, thus it'll always give a winning advantage for Black.  
  
  ---
  
  ### Answer by username_3 on 2015-12-31. Score: 4
  
  I am running SCID on the front and Stockfish 6 on the back. Stockfish is running on 4 cores with a gigabyte of RAM. The computer is an Intel quad-core 3.2GHz i5, 16Gb of RAM, 64-bit OS.
  I am not using a tablebase. I am not sure it matters; the first move or two are the hard ones.
  
  
  [title "Behting study and Stockfish 6"]
  [fen "8/8/7p/3KNN1k/2p4p/8/3P2p1/8 w - - 0 1"]
  
  1.Kc6 g1=Q 2.Nxh4 Qa1 3.Nhf3 Qa5 4.Kd6 Qa2 5.Kc5 Qb3 6.Kd4 Qb4 7.Kd5 c3 8.dxc3 Qxc3 9.Ke4 Qc5 10.Kd3 Qd5+ 11.Ke3 Qd1 12.Ke4 Qb1+ 13.Ke3 Qc1+ 14.Kd4 Qf4+ 15.Kd3 Qa4 16.Ke3 Qc2 17.Kd4 Qe2 18.Kd5 Qb5+ 19.Ke4 Qb7+ 20.Kd4 Qc7 21.Ke4 Qb6 22.Kd3 Qa6+ 23.Ke3 Qa3+ 24.Ke4 Qf8 25.Ke3 Qb4 26.Kd3 Qf4 27.Ke2 Qf5 28.Ke3 Qf8 29.Ke4 Qc8 30.Kd5 Qa8+ 31.Kd4 Qb7 32.Ke3 Qd5 33.Kf4 Qb7
  
  
  I think the "no computer can solve this" comment is very dated... the person who said it mentioned Anatoly Karpov...
  And as requested (rudely), here's a screen shot.
  
  > **Comments:**
  > **username_3**: The lines at the top are the first lines it tried. Each line further down reflects a refinement. As you read down, you'll see it find `Kc6`, then try `Ng7`, then go back the `Kc6`.  There it will stay.  
  > **username_3**: The engine won't rate the position as 0 for this type of draw. While we know it is a draw, Stockfish is dutifully searching for a solution. Even if it knows the 50 move rule, it will have _countless_ alternatives. Since it has what ought to be a decisive material advantage, I doubt a draw will make it happy. It's going to search a long long time.  I don't know what the depth is at the time of the screenshot. The analysis snipped is indicative of what it was doing, however.  
  
  ---
  
  ### Answer by username_5 on 2022-09-19. Score: 4
  
  According to this post by u/dangi12012-1, Behting Study Cracked by Stockfish at depth 70!, Stockfish 12 NNUE evaluated 0.00 after 25 minutes with a powerful 16-core AMD Ryzen 3950X and 58 GB hash.
  The post has the full info but here is the final PV:
  info depth 72 seldepth 23 multipv 1 score cp 0 nodes 459232159581 nps 102464614 hashfull 426 tbhits 0 time 4481861 pv d5c6 g2g1q f5h4 g1a7 h4f3 a7a6 c6c5 c4c3 d2c3 a6a7 c5d6 a7a3 d6e6 a3c3 e6d5 c3c8 d5e4 c8h3 e4d5 h3g3 d5e4
  
  After 1. Kc6 g1=Q, Stockfish 14 on Lichess analysis board considers it a draw, but then reconsiders and puts it at -2.5. After dxc3 this is a 7-piece tablebase draw but Lichess analysis doesn't have that.
  [Title "Stockfish 12 NNUE at depth 72"]
  [FEN "8/8/7p/3KNN1k/2p4p/8/3P2p1/8 w - - 0 1"]
  
  1. Kc6 g1=Q 2. Nxh4 Qa7 3. Nhf3 Qa6+ 4. Kc5 c3 5. dxc3 Qa7+ 6. Kd6 Qa3+ 7. Ke6 Qxc3 8. Kd5 Qc8 9. Ke4 Qh3 10. Kd5 Qg3 11. Ke4
  
  
  For what it's worth, I tried it out on my own relatively modest laptop with i7-7700HQ, 8 cores, 16 GB hash and Stockfish 15 NNUE for about 40 minutes and it still gave -4.65 eval, after 18 billion nodes instead of 459 billion. Probably would've benefited a lot from a 7-piece tablebase, or even just the 6-piece one.
  info depth 69 seldepth 130 multipv 1 score cp -456 nodes 18878194760 nps 8098927 hashfull 691 tbhits 0 time 2330950 pv f5g7 h5g5 e5f3 g5g4 d5e4 h4h3 g7f5 g2g1q f3g1 h3h2 f5h6 g4h5 g1f3 h2h1q h6f5 h5g4 f5e3 g4g3 e3f5 g3f2 f5d4 h1h7 e4d5 h7c7 f3e5 c7a5 d5e4 a5a2 e5g4 f2e1 d4f3 e1e2 g4e5 a2a6 e4d5 a6b5 d5d4 e2f2 d4e4 b5b7 e4d4 f2g3 d4c4 g3f4 c4c5 b7a6 c5d5 a6a5 d5d6 a5d8 d6c5 f4e4 d2d3 e4f4 c5c6 d8f6 c6d5 f6b6 d3d4 b6b3 d5d6 b3a3 d6e6 a3a6 e6d5 a6b6 f3h4 b6d8 d5e6 d8d4 e5g6 f4e4 e6e7 d4a7 e7f6 a7f2 f6e6 f2e3 e6e7 e3e2 e7f7 e2f1 f7e7 e4d5 h4g2 f1a1 g2f4 d5e4 f4e6 a1a7 e7f6 a7f2 f6e7 e4f5 g6f8 f2e3 e7d6 e3d3 d6c6 d3d2 e6c5 d2h6 c5e6 f5e5 c6c7 h6e3 c7c6 e3f3 c6d7 f3f7 d7c6 f7e8 c6c7
  
  The current PGN viewer at move 11 doesn't recognize in a valid PGN that Nd4 can only refer to one knight, so move 11 has to be written out.
  [title "Stockfish 15 NNUE at depth 69"]
  [fen "8/8/7p/3KNN1k/2p4p/8/3P2p1/8 w - - 0 1"]
  
  
  1. Ng7+ Kg5 2. Nf3+ Kg4 3. Ke4 h3 4. Nf5 g1=Q 5. Nxg1 h2 6. Nxh6+ Kh5 7. Nf3 h1=Q 8. Nf5 Kg4 9. Ne3+ Kg3 10. Nf5+ Kf2 11. Nf5d4 Qh7+ 12. Kd5 Qc7 13. Ne5 Qa5+ 14. Ke4 Qa2 15. Ng4+ Ke1 16. Nf3+ Ke2 17. Nge5 Qa6 18. Kd5 Qb5+ 19. Kd4 Kf2 20. Ke4 Qb7+ 21. Kd4 Kg3 22. Kxc4 Kf4 23. Kc5 Qa6 24. Kd5 Qa5+ 25. Kd6 Qd8+ 26. Kc5 Ke4 27. d3+ Kf4 28. Kc6 Qf6+ 29. Kd5 Qb6 30. d4 Qb3+ 31. Kd6 Qa3+ 32. Ke6 Qa6+ 33. Kd5 Qb6 34. Nh4 Qd8+ 35. Ke6 Qxd4
  
  Now, do you count engines using tablebases as solving the study? Stockfish with just the 5-man tablebase (a couple hundred megabytes of relevant files) is able to compute a draw in a few minutes. The eval quickly neutralizes from -4 to 0.0 around depth 45 and stays there for increased depth (tested up to 72).
  info depth 45 seldepth 54 multipv 1 score cp 0 nodes 2418702985 nps 8967492 hashfull 60 tbhits 3503813 time 269719 pv d5c6 g2g1q f5h4 g1a1 h4f3 a1a8 c6c5 a8a3 c5c4 a3d6 d2d4 d6a6 c4c5 a6e6 d4d5 e6c8 c5d4 c8c7 d5d6 c7d6 d4e4 d6c5 e4d3 c5f2 d3e4 f2e2 e4f4 e2c2 f4g3 c2a4 g3h2 a4f4 h2g2 f4e3 g2g3 e3b3
  
  I also left Crystal, a Stockfish derivative designed to solve chess problems, on overnight, but it computes depth much slower than stockfish and didn't solve the study.
  info depth 57 seldepth 118 multipv 1 score cp -245 nodes 9016985399 nps 9322203 hashfull 519 tbhits 0 time 967259 pv f5g7 h5g5 e5f3 g5g4 g7f5 h4h3 d5e4 g2g1q f3g1 h3h2 f5h6 g4h5 g1f3 h2h1q h6f5 h5g4 f5e3 g4g3 e3f5 g3g2 e4e3 h1c1 f5d4 c1a3 e3f4 a3b4 f4e3 b4b8 f3h4 g2g3 h4f5 g3h3 d4f3 h3g2 f5d4 b8e8 e3f4 e8h5 f4e3 h5d5 f3e1 g2g3 e1f3 d5c5 e3e4 c5h5 d4f5 g3f2 f5d4 h5h1 e4d5 f2g3 d5c4 h1f1 c4d5 g3f4 f3e5 f1g2 d4f3 g2g8 d5d4 g8b3 d4c5 b3a3 c5d5 a3a2 d5d4 a2b2 d4d5 b2b6 d2d3 b6d8 d5e6 d8a5 e6d6 a5b4 d6e6 b4c5 d3d4 c5b6 e6d5 b6b3 d5d6 b3b8 d6c5 b8a7 c5d6 a7a6 d6d5 a6b6 f3h4 b6a5 d5e6 f4e4 e6e7 a5c7 e7e6 c7d8 e5g6 d8b6 e6f7 b6d4 f7e7 d4f2 e7e6 f2f1 e6e7 e4d5 h4g2 f1f2 g2f4 d5e4 f4e6 f2a7 e7f6
  
  
  ---
  
  ### Answer by username_9 on 2016-01-01. Score: 3
  
  This has turned into a hot discussion... I take it positively because we need more traffic.
  
  I'm confident all the well written engines will give Kc6 with sufficient thinking time. That's because all other alternatives are even worse. The line starting with Kc6 is the only line that the computer finds with 2 knights vs queen. Everything else results in further material loss and therefore discarded.
  
  Since the engine is able to see Kc6 would be the only move not losing instantly, the puzzle should be considered solved.
  
  It's insane for the Stockfish engine to give a 0.00 score in this kind of position because it is simply not designed for something like this.
  
  
  ---
  
  