Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Recursive Null-Move Pruning

Author: Jon Dart

Date: 12:34:39 07/08/02

Go up one level in this thread


Your original post implied to me that you were asking about the benefits of
recursive null pruning in general (vs. non-recursive pruning). I think it's
pretty clear that this is a big win for many programs, although some still use
no null pruning or a more restrictive version.

If you're asking if R=2 is better than R=3 or R=2/3 (adaptive), I've tried
adaptive null pruning from time to time (it's a compile-time switch in my
program) and I always wind up going back to R=2 (recursive). Adaptive null
pruning does a little worse on test suites, in my experience. But it seems that
other programmers have had different experiences.

--Jon



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.