Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: null move efficiency

Author: Tord Romstad

Date: 10:20:22 04/20/04

Go up one level in this thread


On April 20, 2004 at 12:42:14, Tord Romstad wrote:

>if(depth > 3*PLY) {
>  make_null_move();
>  null_value = -qsearch(-alpha, -alpha+1);
>  unmake_null_move();
>} else null_value = alpha;
>
>if(null_value >= alpha) {
>  null_value = -search(-beta, -beta+1, depth-(R+1)*PLY);
>  if(null_value >= beta) return null_value;
>}

Oops, there's a bug in my pseudo code.  There should have been a
make_null_move()
and unmake_null_move() around the second call to search above, of course.

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.