Author: Dann Corbit
Date: 20:08:21 02/11/00
Go up one level in this thread
On February 11, 2000 at 22:49:25, Tom Kerrigan wrote: >On February 11, 2000 at 19:48:09, Dann Corbit wrote: > >>You can't tell how strong a program is by counting how many nodes it examines. >>Turn off NULL move and it will search more nodes with less effect, for instance. >> Remove all positional checking and it will search even more nodes. By a >>judicious removal of tests, you could probably double the node counts and halve >>the playing strength. >> >>The proof of the pudding is in the eating. Play a 500 game match between two >>versions and tell us how it turns out. Use separate machines, and turn >>pondering on. > >While this is all correct, it seems to have very little to do with the original >post. Hmmm... I must not have understood what he wanted. He showed a table of NPS for various crafties. The fastest version completed the bench 1.076 times faster than the slowest one. He asked which was the best. I said you can't just count nodes to know the answer. What do you think he was asking?
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.