Author: Miguel A. Ballicora
Date: 10:03:07 08/15/02
Go up one level in this thread
On August 15, 2002 at 08:31:36, Uri Blass wrote: >On August 14, 2002 at 06:37:04, T. Opas wrote: > >>On August 13, 2002 at 23:42:32, Uri Blass wrote: >> >>>On August 13, 2002 at 19:04:59, Mike S. wrote: >>> >>>>On August 13, 2002 at 17:05:24, Chris wrote: >>>> >>>>>4rrk1/1bpR1p2/1pq1pQp1/p3P2p/P1PR3P/5N2/2P2PP1/6K1 w - a6 0 31 >>>>>Does any program find Shorts 31. Kh2? >>>>> >>>>>31.Kh2! Rc8 32.Kg3 Rce8 33.Kf4 Bc8 34.Kg5 with the idea Kh6 and mate.. >>>>> >>>>>The idea of mating with the king in the middle game is very unusual, but maybe >>>>>the programs can find it anyway by using brute force? >>> >>>I tried deep fritz for some hours(selectivity=0,p850,64 mbytes) with no success >>>so maybe black has a defence after Kh2. >>> >>Theres no defence: >> >>31.Kh2! Bc8 (best blacks move) 32.Ng5! Qxd7 (32....Bxd7 33.g4! hxg4 34.h5! +-) >>33.Rxd7 Bxd7 34.g4! +- >> >>Las > >You are right. > >The question is how much time programs need to see >a winning score from the root position(the only open question >is if Kh2 is the only way to win) . > >Finding 32.Ng5 is also a good test position >and here not using null move pruning does not help. On the contrary, I think that null move pruning hurts here. Miguel > >[D]2b1rrk1/2pR1p2/1pq1pQp1/p3P2p/P1PR3P/5N2/2P2PPK/8 w - - 0 2 > >Uri
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.