Computer Chess Club Archives

Search

Messages

Subject: Results without iterative deepening

Author: Michel Langeveld

Date: 02:50:55 12/31/01

Go up one level in this thread

On December 31, 2001 at 05:28:54, Dann Corbit wrote:

>On December 31, 2001 at 05:26:11, Michel Langeveld wrote:
>>I want to check how efficient Nullmover is.
>
>By how often you fail high on your first choice.

I get the following statistics without internal iterative deepening:

DATA:
  total nodes               : 12677301
  eval nodes                : 9214933
  qsearch calls             : 6094761
  nodes generated by qsearch: 3130177
  total qsearch nodes       : 9224938
NULLMOVE DATA:
  nullmove starts                            : 71293
  nodes after nullmove                       : 9481561
  qsearch calls after a nullmove             : 2826437
  nodes generated by qsearch after a nullmove: 1746080
  total qsearch nodes after a nullmove       : 4572517
MOVE ORDERING:
  total moves played        : 12606007
  beta cutoffs              : 1839740
  times first moves was best: 1683605
  betaCounterNth            : 2196524
HASH:
  hashRecords               : 6345235
  hashProbes                : 9547123
  hashHit                   : 1935182

The % of the firstmove is a beta cutoff = 91.5%
The average place of the best move      = 1.19

Is this good?

Michel

• Re: Results without iterative deepening Dann Corbit 03:17:41 12/31/01

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.