Author: leonid
Date: 15:51:37 01/25/00
Go up one level in this thread
On January 25, 2000 at 16:53:45, Dann Corbit wrote: >NPS has almost no meaning for two different programs. > >Consider Fritz and MChess. Two very different approaches (both of which are >valid). > >A program can only be benchmarked against itself in NPS. I think plies are a >much better gague of performance, but even that is a very misleading label most >of the time. Agree with you 100%. Only sometime it is curious to know speed in nodes per second to give you some general impression. Beside solving the mate containing position (there you know exactly in what number of plies solution existe and where time spent for solving it is 100% comparable) all other comparaison of the basic speed for the chess logic is impossible. Leonid. >So it all boils down to "The proof of the pudding is in the eating."
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.