Author: TEERAPONG TOVIRAT
Date: 22:46:28 09/19/03
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
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.