Author: Bruce Moreland
Date: 01:03:03 10/20/00
Go up one level in this thread
On October 19, 2000 at 22:07:42, Michael Neish wrote: > >Hi, > >I wonder whether anyone might be able to explain why my program cannot see the >solution to BT2630 #3 below > >[D]5r1k/p1q2pp1/1pb4p/n3R1NQ/7P/3B1P2/2P3P1/7K w - - > >The solution is 1. Re6, leading to the following tactics: > >1. Re6 Kg8 >2. Rxh6 gxh6 >3. Qxh6 f5 >4. Qxf8+ Kxf8 >5. Ne6+ forking King and Queen and gaining material. > >My program does not see this if it searches 8-ply deep, even though it is doing >check extensions, and should therefore see it (I think) because there are two >checks in the sequence. I know that Bob helped you with this and you posted that you've figured it out, but something to remember is that you can't just figure out how deep the winning line is and assume that you can find the thing if you search that deep. Every move you make along the winning line allows a multitude of opponent replies, and if even one of them delays things, even if the eventual result is worse for the opponent, you won't see the winning line. bruce
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.