Author: John Merlino
Date: 11:35:51 08/22/03
Go up one level in this thread
On August 22, 2003 at 12:09:36, Mihaly Szalai wrote: >John, > >Chessmaster doesn't show the main variation: > >[D]8/3p1P2/3Pp3/2p1P2K/p1p3P1/PpP3p1/1P3pP1/6k1 w - - 0 1 > >1. f8=R f1=Q 2. Rxf1+ Kxf1 3. g5 Kxg2 4. g6 Kh2 5. g7 g2 6. g8=Q g1=Q 7. Qxg1+ >Kxg1 8. Kg6 Kf2 9. Kf6 Ke2 10. Ke7 Kd2 11. Kxd7 Kc2 12. Kxe6 Kxb2 13. d7 Kxa3 > >and at this juncture: > >[D]8/3P4/4K3/2p1P3/p1p5/kpP5/8/8 w - - 0 14 > >white has to underpromote again in order to win... > >Mihaly Fair enough. However, I think that asking an engine to find an underpromotion 27 ply away from the current position is a bit much. AND it looks like finding the underpromotion from THIS position requires at least a dozen ply search. So, you're asking the engine to search 40 plies from the initial position in order for it to give a correct answer. Can you tell me an engine that can do this? I looked at the other replies so far and none of them have done it. jm
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.