Author: Dieter Buerssner
Date: 13:19:50 07/29/03
Go up one level in this thread
On July 29, 2003 at 12:05:59, Angrim wrote: >perft includes makeing moves, and checking moves for legality, so it >will be much slower than just generating pseudo-legal moves for the >same position over and over. I just coded up a routine to do a few >million calls to get_chess_moves() from the current position and >time it, and from the e4 e5 d4 d5 position I get the equivalent of >60meg moves per second on a 2ghz machine. My perft only gets equiv >of 4.8 meg positions a second though, since my InCheck is pretty slow. > >note that my Athlon is actually running at 1.15ghz currently, so I >multiplied my actual results by (2.0/1.15) to get 2ghz equivalent. On my 2.53 GHz P4, in that position my engine generates about 100 million moves/s (or 25 CPU cycles per move). I think, rather comparable to your number. In real games, it is only a little fraction (nothing worth to worry about much) of the time spent for one node. Of course, such a test is a bit flawed (everything will be in cache). Regards, Dieter
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.