Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Another simple search question

Author: Andrew Wagner

Date: 17:50:58 05/23/04

Go up one level in this thread


On May 23, 2004 at 20:41:30, William Bryant wrote:

>Do you search the best move from the hash table before or after you try a null
>move search?
>
>William

After. The idea with null-move is to see if it's even worth trying any "real"
searches. A hash move is searched to full depth, whereas after making a null
move you searched to a reduced depth. So if you can cut off with doing less
work, you want to try that first.



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.