Author: Joshua Lee
Date: 00:51:15 01/23/01
Go up one level in this thread
On January 22, 2001 at 23:35:38, Dann Corbit wrote: >On January 22, 2001 at 20:01:22, Bruce Moreland wrote: > >>[D]r4r1k/4bppb/2n1p2p/p1n1P3/1p1p1BNP/3P1NP1/qP2QPB1/2RR2K1 w - - 0 1 >> >>After a trillion nodes (19 plies) my program can't solve this. >> >>It wants to play Nxh6 with a dubious +1 score (up an exchange for a pawn, and >>probably losing a pawn), but it can't find the key, which is Ng5. >> >>If this is solvable, it is much harder than many of the others. > >This position is supposed to be from: >Weinstein-Elyoseph, Israel, 1992 > >I cannot find this game. Does anyone have a copy of it? I posted a message within the past two weeks asking the same question ... all i got was what the line is supposed to be that's winning. I have looked at this with fritz and i can safetly say this one is Harder than Nolot 5 which it solved in 26 Hours and 19Ply. This one will take over 25Ply i believe but i can check soon as i figure out why Windows 2000 likes Locking up even with SP1 and all the right drivers!!! bios settings and AGP = No fun
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.