Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Crafty question: SearchRoot & Hash table?

Author: Robert Hyatt

Date: 07:13:36 01/24/01

Go up one level in this thread


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?

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.