Author: Andreas Guettinger
Date: 08:05:26 12/17/02
Go up one level in this thread
On December 17, 2002 at 10:53:25, Vincent Diepeveen wrote: >>In evaluation i do something like >> >>while (!lLASTPIECE) >> if (piecelist[i] !=EMPTY) >> evaluate > >that's again easy to improve in 2 ways. >First of all is using do .. while, instead of a while. >though most compilers will translate it to a 'do .. while' (i hope) >the processors are having in general a fall through principle which >works great. > >Secondly use a local variable to replace that piecelist[i]. > I didn't quite get that. How do you replace an array by a local variable? >>and i wonderded if this could be speed uop by using a bitboard. > >Not at all. bitboards are meant for 64 bits processors and comparing >them at 32 bits processors is not only not fair it is also a quickly >run race. > >Factor 2.2 is what i measure in speed difference. > >But improving programming isn't a bad idea in general when i look >to the above code. > >Best regards, >Vincent I think 0x88 is already fast enough, or can be optimized by other means than by 64bit processors. So i don't fear the 64bit age. :) Andreas
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.