Author: Bruce Moreland
Date: 14:15:06 02/08/99
Go up one level in this thread
On February 08, 1999 at 14:46:31, Stuart Cracraft wrote: > >Hi, > >I'm thinking of eliminating the majority of function calls >from the GNU 5.0 static evaluator. > >For example, right now, about 12 function calls are used per >static evaluation of one position. > >These function calls are to the individual piece evaluators >(pawn, knight, etc.) for white and black. > >Since this would potentially eliminate an order of 10^3 .. 10^4 >or more function calls per search, before I do the work, I >want to know what other people's experiences have been. > >For example, Crafty has a giant Evaluate () routine wherein >it looks like individual piece evaluations for each side >(duplicate code) are enclosed in that giant routine. Try it and see. I've heard people say way more dumb stuff than smart stuff when discussing performance optimization. A chess program is complicated, but not so complicated that you can't try a few different ways of doing the same thing and see which of them is faster. And if you can't figure out which of them is faster, it's an argument for doing things in a way that you can read, since it obviously doesn't make a detectable difference to do it the hard way. bruce
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.