Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: time of move generation

Author: Dann Corbit

Date: 12:24:10 09/10/02

Go up one level in this thread


On September 10, 2002 at 15:02:51, Jean Bouchat wrote:

>Hello,
>we are writing a new chess-engine (not ready for release: it can only move pawns
>and knights) and I wonder how fast is your move generator functions. Let's take
>for example the starting position. I called ours 1 million times on a PIII 733
>MHz. This includes the legality of the moves(no check), memory allocation for
>the 20 new positions and freeing of this memory at each call. It takes 16
>seconds.
>Is it fast?

Not particularly.

I recommend against dynamic memory allocation of the positions if you can avoid
it.
---------------------------------
Beowulf:
[1]W > perft 5
Progress : ....................
Total: 4865609 Moves
2.39 Seconds
---------------------------------
Crafty v18.15:
White(1): perft 5
total moves=4865609  time=1.94
White(1):
---------------------------------
DeepSjeng:
Sjeng: perft 5
Raw nodes for depth 5: 4865609
Time : 2.02
---------------------------------
List:
perft 5
time=123  nodes=4865609
(that's 1.23 seconds)
---------------------------------
Pepito:
Pepito> perft 5

Time spent: 1.78
Paths searched: 4865609
Pepito>
---------------------------------
Resp:
RESP> perft 5
PERFT ... DEPTH = 5

NODES       = 4865609
TIME USED   = 1.993
NODES/SEC   = 2.44135e+006
---------------------------------
Yace:
white ( 1): perft 5
 1:              20
 2:             400
 3:            8902
 4:          197281
 5:         4865609
Used 1.125 s
---------------------------------

Yace appears to be fastest, with 4,324,986 NPS.  The slowest of this group still
managed 2,035,820 NPS.



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.