Computer Chess Club Archives

Search

Messages

Subject: Adaptive null move pruning

Author: Sanjiv Karnataki

Date: 22:34:48 02/28/00

Hi All,

I just finished reading Ernest Heinz's article on the subject and I had a
question about the code sample. It uses a routine called "try_null" that is not
given in the article and the only thing the article says is "tries to avoid
superfluous null-move searches that do not really promise to cut off as decided
by the function try_null"

Does anyone know how that decision could be made? I was thinking of trying it in
my program.

Thank you

Sanjiv.

• Re: Adaptive null move pruning Ernst A. Heinz 09:09:08 03/02/00
  • Re: Adaptive null move pruning J. Wesley Cleveland 17:01:56 03/02/00
• Re: Adaptive null move pruning Bas Hamstra 00:19:00 02/29/00
  • Re: Adaptive null move pruning Robert Hyatt 05:39:14 02/29/00
    • Re: Adaptive null move pruning Dan Newman 16:43:12 02/29/00
    • Re: Adaptive null move pruning Sanjiv Karnataki 08:06:45 02/29/00
      • Re: Adaptive null move pruning Robert Hyatt 14:30:08 02/29/00
  • Re: Adaptive null move pruning Chua Kong Sian 00:34:42 02/29/00

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.