Author: Heiner Marxen
Date: 03:48:15 07/18/01
Go up one level in this thread
On July 17, 2001 at 22:17:21, Angrim wrote: >On July 17, 2001 at 08:33:49, leonid wrote: > >>Hello! >> >>This position you can try with every program. Its number of moves is only 89. >> >>[D]k1qnr3/1qq5/qn2Q3/qN1QqQ1K/qN2QqQ1/RbQQqQ2/1RrbQ3/2BB4 w - - >> >>Please indicate your result. >> >>Thanks, >>Leonid. > >this one was trivial with pn^2 >proved that move b5xc7 wins, 15 turns >PN2:509049 evals, 11436 expands, 4.39 seconds > >As usual with this type of position, my alpha-beta search was unable to >finish 1 ply deep in any reasonable amount of time. Too much qsearch.. > >Angrim May be that hashing within qsearch would make a huge difference here. Have you tried to do that? Heiner
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.