Author: KarinsDad
Date: 09:53:31 07/20/99
Go up one level in this thread
On July 20, 1999 at 12:47:29, Dan Homan wrote: >On July 20, 1999 at 12:12:14, Dann Corbit wrote: > >>I think it would be interesting to benchmark chess algorithms: >>0. Move generators -- all types > >This one is do-able by restricting ourselves to moves generated per >second in a standard position. From the opening, EXchess >generates approximately 3.0 million moves per second on a 400 MHz Cel. >The move generation algorithm is a simple loop over the board (stored >as a 64 square array) with simple logic checks to find the boundry. > >For generate/make/unmake EXchess preforms approximately 600,000 moves >per second on the 400 MHz Cel. My make involves a position copy, so >I don't do an unmake routine. The formula here is 1) generate all >the moves from a given position 2) make/unmake each move in turn >3) count the moves generated/made/unmade. > What if your program only generates legal moves and there is no unmake? Again, I am skeptical. All of this is similar to the nodes per second issue where each implementation (sometimes from one version of the same program to the next) is different. KarinsDad :)
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.