Author: Andrew Dados
Date: 01:26:15 09/20/03
Go up one level in this thread
On September 20, 2003 at 01:46:28, TEERAPONG TOVIRAT wrote: >Hi all, > >Suppose the nodes/sec(NPS) of program A is X and NPS of B is 3x. >If both have the same type of move generation(). Can I infer that A >has at least 4-5 times more complicated evaluation()? > >Thanks for all opinions, >Teerapong if A has some sophisticated pruning it may happen that both A and B have same evaluation and then A is 3x slower in nps (but goes 2-3 plies deeper then B)
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.