Author: Tord Romstad
Date: 04:00:48 11/05/01
Go up one level in this thread
On November 04, 2001 at 17:41:06, Michel Langeveld wrote:
>Don't forget to look at Bruce Mooreland's excellent homepage about
>computerchess: http://www.seanet.com/~brucemo/toc.htm
This looks like a very good site --- thanks to you for mentioning it, and
to Bruce for writing it!
I was a bit surprised to see the suggested implementation of the null move
heuristic on Bruce's homepage, the alpha-beta window is different from what
I have always used. This is the code fragment:
MakeNullMove();
val = -AlphaBeta(depth - 1 - R, -beta, -beta + 1);
UnmakeNullMove();
if (val >= beta)
return beta;
In my code, I have something like
val = -AlphaBeta(depth - 1 - R, -beta, mate_value);
which I always thought was the normal way of doing things. The advantage
of my method is that I can often detect serious tactical threats, while
Bruce's approach has the obvious advantage that it searches fewer nodes.
Without extensive testing, it is not clear to me which technique works
better.
What alpha-beta window do the rest of you use? If anybody has tried both,
which approach works better?
Tord
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.