Author: Rémi Coulom
Date: 02:51:09 01/14/03
Go up one level in this thread
On January 13, 2003 at 16:12:33, Bas Hamstra wrote: > >It looks very tight. I noticed the few little shifts I did are really costly, >just eliminating the 1<<Type gives 20%, so I will probably try something like >this... Besides it also got me thinking about shifts in other (heavily >used)places. Replacing the Piecelist[x][y] with a pointer seems to give no >noticable improvement, neither does replacing for() with do-while(). For >Borland, that is. > >Best regards, >Bas. Yes, those shifts are costly. You might have noticed in my source code that with a clever choice of piece values, it is possible to get everything to work without any shift at all. Rémi
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.