Author: David Blackman
Date: 00:11:15 07/23/00
Go up one level in this thread
On July 22, 2000 at 10:36:41, Larry Griffiths wrote: >Hi, >This ran on a Pentium III 550Mhz Xeon processor... >This divides out to about 1,974,757 moves per second... > >I read a thread in the last couple of months where some folks stated that their >programs were around 5 million moves per second. > >Do I still have a lot of tuning and optimization to do? > >Larry. I think the people getting 5 million nodes per second had about 8 cpus. Its unlikely that anyone gets 5 million nodes per second on a single Pentium III @ 550. If they did, it would have to be such a stripped down program, that it wouldn't actually play good chess. (Little or no eval, and poor move ordering.) Somewhere around 1 million is probably right for a fast/dumb but competitive program on that hardware. Try putting in a full alpha-beta engine, or some variant that works at least as well, plus sensible move ordering, quiescence search (probably just captures), and a simple eval with at least piece-square tables. If you still get 2 million nodes per second, you've really got something. Yes, you should count quiescence nodes in the node count. Hint for writing fast/dumb programs: you don't have to generate all legal moves for every position. In most positions in the tree, you are only going to try at most a few legal moves, so generating all of them is a waste of time. Also, it is not necessary to be fast/dumb to be strong, although that is probably the easiest kind of strong program to write. If you write a smart program getting less than 100KNodes/sec on your hardware, you will find that the speed of the move generator and makemove is mostly irrelevant.
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.