Author: Brian Richardson
Date: 13:14:09 05/03/00
Go up one level in this thread
On May 03, 2000 at 10:20:14, Severi Salminen wrote: >Hi everybody! > >I would like to know how fast should my program reach (say) ply 8 from starting >position, using AB, no hash tables, no extensions, no null move pruning. Just >plain AB with ordering and very simple evaluation (material, mobility and >developement). How many nodes/second should my program access? I'm asking this >to see if my program has bad basic routines which I should improve before other >things. I am using an old Celeron (which lacks some inner cache), 300Mhz. How >fast are your programs? > >Severi Difficult to say since most programs already have numerous search enhancements already built in and it would be tedious to disable them for comparisons. The best bet might be to start with TSCP. If your program does not use killer moves or history you could more easily disable these techniques in TSCP. Once your program is several times faster, download one of the other more sophisticated programs source that you can change to test against.
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.