Author: Scott Gasch
Date: 00:17:02 07/18/99
What are the typical ways people use to improve the speed of the searching algorithm? Here's what I have done: move ordering / history, memory pool for moves so I am not calling malloc/free, optimized my C as much as I can, save a pointer to the kings on a board representation so I do not have to search for them when looking for checks. And still the program is sluggish; it gets a little over 20,000 nodes/sec on my AMD K6-3 400. For comparison I clocked TSCP on the same machine and it is getting about 15,000 nodes/sec. How can I speed this up more? What is a good speed on this kind of hardware? Thanks, Scott
This page took 0.01 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.