Author: rasjid chan
Date: 10:26:31 04/16/04
Go up one level in this thread
On April 16, 2004 at 06:14:25, Andreas Guettinger wrote: >Could somebody recap how the final macros look like, all inlined? >What bitboards are needed to use the macros? >Is the overhead of maintaining the bitmaps worth it? >Is it a speedup to 0x88? Do you think its faster than a for loop checking for >blocked squares between x and y? > >regards >Andy I think Gerd knows more about bitboards and has better functions than the ones I first posted; but if you want those, you could get from that post and just add the "improvement" Gerd found. Maybe very few tested which is faster. It is most likely that even if one is faster by 20%, it may not have any measurable speed impact on the overall speed of a chess program as these calls are use not often and don't take up much of the total time. Best Regards Rasjid
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.