Author: leonid
Date: 19:48:26 05/04/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 Hi! I see that you have probably way of thinking that it is very close to mine. I try, like you, to speed as much as possible the basic logic and only later go to even care about niceties of "extras". You can find your speed in two ways. First is perfect one. Try solve some inevitable mate positions where search for mate goes by brute force. Time needed for solving the same position on both programs give good idea about your engin speed. It is also best way to debug your move generator to heavenly perfection. Finding your speed by using some other program that are very open minded and talkative. For this I see as the best one Rebel. You can see with this chess program nodes per second rate. There you can disconnect at your will hash tables and so like. You can finally use my program that it basic one. It have no "extras" now since its raw speed is not where it must be. It indicate average position per second rate for comparison. If you like to use it, just send me message. Leonid.
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.