Computer Chess Club Archives

Search

Terms

Messages

Subject: Re: An Experiment that disproves Hyatt's 1000X NPS Theory

Author: Ryan B.

Date: 09:49:06 09/17/05

I thought this rediculess theory was proven wrong with the Crafty vs Rebel thing
a long time ago.  It is far more complicated than just the NPS loss in move
ording, pruning, reduction checks, and extention checks that all can improve a
program while reducing the NPS.  As well what is known by the eval function and
how it is used can be much more valuable than even another few ply searched but
causing a very large loss in NPS.  Hiarcs on slow hardware vs GNU Chess on fast
hardware should show a good example of this.

Re: An Experiment that disproves Hyatt's 1000X NPS Theory Robert Hyatt 18:53:26 09/17/05
- Re: An Experiment that disproves Hyatt's 1000X NPS Theory Ryan B. 20:32:46 09/17/05
  - Re: An Experiment that disproves Hyatt's 1000X NPS Theory Robert Hyatt 20:49:59 09/17/05
    - Re: An Experiment that disproves Hyatt's 1000X NPS Theory Ryan B. 21:28:19 09/17/05
      - Re: An Experiment that disproves Hyatt's 1000X NPS Theory Robert Hyatt 21:34:50 09/17/05
        
        Re: An Experiment that disproves Hyatt's 1000X NPS Theory Ryan B. 22:07:07 09/17/05
        
        Re: An Experiment that disproves Hyatt's 1000X NPS Theory Robert Hyatt 07:37:35 09/18/05
        
        Re: An Experiment that disproves Hyatt's 1000X NPS Theory Rolf Tueschen 04:05:04 09/18/05
        
        Re: An Experiment that disproves Hyatt's 1000X NPS Theory Ryan B. 10:47:17 09/18/05
Re: An Experiment that disproves Hyatt's 1000X NPS Theory ALI MIRAFZALI 14:13:02 09/17/05
Re: An Experiment that disproves Hyatt's 1000X NPS Theory Uri Blass 10:16:00 09/17/05

This page took 0.01 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.