Author: Kim Roper Jensen
Date: 10:51:02 09/10/02
Hi I just got an idea or maybe just a brain meltdown, but how about this ? Assumption: =========== In a bitboard evaluation routine, some bitboards will be generated multiple times for various evaluations. Idea for Optimization: ====================== Make an editor where the evaluation routine is described in a meta-language. Then let the editor/parser analyze the various subcomponents in the evaluation routine and optimize /rearrange the code so there a minimum amount of duplicate generated bitboards. Convert the code to a source file in C/C++/Java etc. and compile the chess program. Shouldnt this give a improvement in execution of the evaluation routine ?? PS. I know it looks like the Che+ language of Nimzo, I dont have Nimzo so I dont know if its the same, but it is the idea of the code rearranging that I wanted to ask about. PPS. My crappy(yes thats the name of the program if it isnt taken by someone else) little program doesnt use bitboards(yet :) so maybe im way off here.
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.