Author: Robert Hyatt
Date: 20:48:57 12/04/02
Go up one level in this thread
On December 03, 2002 at 23:34:08, Russell Reagan wrote: >On December 03, 2002 at 20:52:52, Christophe Theron wrote: > >>So you don't have that basic information about "moves which are roughly equal" >>unless you are ready to slow down these algorithms by a factor of 100 or more, >>which would make your program much weaker. > >Why "100 or more"? Why not "around 35" since that's the number of legal moves in >most positions? > >Russell This is an exponential problem. to order the moves best to worst at the root would take 35X longer as you would search every move with the same initial wide window. If you do this at ply-2, it now becomes 35*35 times slower. Ditto for ply N where it becomes 35^N times slower. Until you reach pure minimax to do it at all plies...
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.