Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Maybe Bob can give us an idea if he thinks it might help crafty.

Author: Robert Hyatt

Date: 07:34:07 02/08/03

Go up one level in this thread


On February 08, 2003 at 05:13:11, scott farrell wrote:

>After all the ideas I have 'borrowed' from crafty, I would only hope that one
>day I could be responsible for a line or 2 when crafty plays the next CCT.
>
>SCott


I'm pretty sure this is going to produce worse results in Crafty.  A couple of
things:

1.  You are using a mixed-depth search, D+1 for the first root move, D for
the rest.  I know of no way to _compare_ those results.  IE if a D+1 fails
high, and I don't have time to re-search it, what do I do?  I can't trust a
D ply fail high over a D+1 true score, because the D ply search is shallower
and could be overlooking something critical.

2.  You have to watch the hash table.  Else you are going to store an entry with
the wrong depth at the root.  That will certainly cause a problem on the next
iteration.



This page took 0.01 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.