Author: Larry Griffiths
Date: 07:36:41 07/22/00
Hi, My basic bitboard move generation is in place so I ran a test to get moves-per-second. It is a brute-force recursive function call that generates all the moves for a ply; makes a move for that ply; calls brute-force; then unmoves the ply. I do not have en-passant, castleing, or move validation code in place. This ran on a Pentium III 550Mhz Xeon processor... Here are my results... TCBoard - BruteForce Executed in 1726.16 clock seconds TCBoard - BruteForce Moves Made/UnMade=3408748153.00 TCBoard - BruteForce Ply(1.00) Move Count=20.00 TCBoard - BruteForce Ply(2.00) Move Count=400.00 TCBoard - BruteForce Ply(3.00) Move Count=8902.00 TCBoard - BruteForce Ply(4.00) Move Count=197742.00 TCBoard - BruteForce Ply(5.00) Move Count=4896998.00 TCBoard - BruteForce Ply(6.00) Move Count=120909581.00 TCBoard - BruteForce Ply(7.00) Move Count=3282734510.00 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.
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.