Author: Stefano Gemma
Date: 01:04:03 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()? I suppose that, in a lot of cases, that's true. My programs have a simple evaluation function and that give me a big nodes/second. But there are some other fact to care about. The use of killer moves, for sample, can easly raise your n/s, because, when the killer move is generated separetly from other moves... and if you cut that node, no other moves were generated. Another thing is the goodness of coding or the compiler optimizations. Maybe you can infer what you said only if it is the same program, or program strictly derived from the same program (as the various Crafty clones). Ciao!!! Stefano Gemma
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.