Author: Vincent Diepeveen
Date: 05:54:11 06/22/01
Go up one level in this thread
On June 21, 2001 at 17:44:05, Dann Corbit wrote: >On June 21, 2001 at 17:07:17, Janos Keinrath wrote: > >> >>I've checked the ECM testsuite with my program and found the following, >>interesting position (ECM.300). >> >>[D] 8/2b2k1p/2N2pp1/P2p4/3KnP2/6BP/P5P1/8 w - - >> >>The solution in the book is right: >> >>1. Kxd5! Nxg3 2.a6 Bb6 3.a4 Ne2 4.a5 Bb1 5.a7!! Bxa7 >>6. Nxa7 Nxf4+ 7.Kd6! +- >> >>Any program find the solution in a reasonale time (less than 5 Min)? > >It may be that Kxd5 also wins, but if it does, it is much deeper. Probably the >bishop move is better (even though the king move looks prettier at first). It Kxd5 wins hardest of all lines, the problem is the nullmove reduction factor for DIEP to find it within 5 minutes. Bh2 is only +3.9 or so. Kxd5 is +8.8 Best regards, Vincent >appears that the problem is 4.a5 Bb1 -- the Bb1 is a mistake. It should be Bg1 >instead. > >[D] 8/2b2k1p/2N2pp1/P2K4/4nP2/6BP/P5P1/8 b - - acd 19; acn 727711951; acs 1000; >ce -83; id "ECM.300 After Kxd5"; pv Nxg3 a6 >Bb6 a4 Ne2 a5 Bg1 f5 Nf4+ Ke4 Nxg2 a7 Bxa7 Nxa7 Nh4 fxg6+ hxg6 Nc6 f5+ Ke5 Nf3+ >Kf4 Ng1 h4;
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.