Difference between revisions of "Null Move Pruning Test Results"

From Chessprogramming wiki
Jump to: navigation, search
 
Line 1: Line 1:
 +
'''[[Main Page|Home]] * [[Engine Testing]] * Null Move Pruning Test Results'''<br/>
 
'''[[Main Page|Home]] * [[Search]]  * [[Selectivity]] * [[Pruning]] * [[Null Move Pruning]] * Test Results'''<br/>
 
'''[[Main Page|Home]] * [[Search]]  * [[Selectivity]] * [[Pruning]] * [[Null Move Pruning]] * Test Results'''<br/>
'''[[Main Page|Home]] * [[Engine Testing]] * Null Move Pruning Test Results'''
 
  
 
Here you can find some experimental [[Engine Testing#TestResults|test results]] on [[Null Move Pruning]] by varying [[Depth Reduction R|R]] on [[Depth]] and other features.
 
Here you can find some experimental [[Engine Testing#TestResults|test results]] on [[Null Move Pruning]] by varying [[Depth Reduction R|R]] on [[Depth]] and other features.

Latest revision as of 20:27, 17 January 2019

Home * Engine Testing * Null Move Pruning Test Results
Home * Search * Selectivity * Pruning * Null Move Pruning * Test Results

Here you can find some experimental test results on Null Move Pruning by varying R on Depth and other features.

Increasing R With Depth

Mark Lefler

One scheme tested by Mark Lefler on 25 October 2007 is as follows:

R=3;
if (side to move has 2 or more pieces) and (depth>7) then R=4;

In a 100 game 1/1 match between Now with and without this change, the change was worth just over 50 Elo. I am now testing against other programs. Followup testing showed only about a 20 Elo gain, with about 100 games against a variety of opponents. Within the error of testing.

See also

Forum Posts

Up one level