Author: Robert Hyatt
Date: 18:41:33 01/24/01
Go up one level in this thread
On January 24, 2001 at 17:55:04, Pham Minh Tri wrote: >On January 24, 2001 at 10:13:36, Robert Hyatt wrote: > >>On January 24, 2001 at 07:02:37, Pham Minh Tri wrote: >> >>>Hi Dr Hyatt, >>> >>>I wonder why you do not use hash table for searching of first ply (SearchRoot >>>function)? I checked and found that sometimes hashtable works in this ply >>>(atleast when program searchs with shallow depths of iterate loop). >>> >>>Thank in advance, >>>Pham >> >>HashProbe() is called before any move is searched. At the root, what good >>would it do to find a score before I try a move? > > >But could it find scores from last search? I mean, if the last search finishs at >10 ply, the results of 1-10 ply are saved in the hash table and useful for roots >of next search when iterate loop works from 1 to 9 ply. Suppose all you get is < .15??? you don't get a move or anything, so how would you use that to start the next iteration? I do probes at ply=2, which is _after_ making each ply=1 move... > >>As a result, I try each ply-1 move, then recursively call search which >>immediately does a probe at ply=2...
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.