Author: Bas Hamstra
Date: 05:08:53 02/09/99
Go up one level in this thread
I tried both on my program a while ago and was surprised *with* many function calls was quite a bit faster on my old BC3.1 compiler. Apparently it was easier to optimize. I think with a good compiler it would not be worth the effort, to eliminate the calls by hand. The compiler does do it for you. Bas Hamstra. 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. > >--Stuart
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.