Author: Russell Reagan
Date: 11:04:13 05/25/02
Go up one level in this thread
On May 25, 2002 at 13:36:46, Gian-Carlo Pascutto wrote: >1) shifting/anding is completely predictable, the if's are not (big difference!) >2) the 2 x 32 bits operations are fast on superscalar machines (all modern CPUs) >3) I do not believe bitboards are necessarily faster on 32 bit machines > >-- >GCP So even if you had 64-bit hardware, using the shift/and method of ray tracing instead of the add/if-test method is only more stable and reliable, but not necessarily faster. The shifting and ANDing is basically ray tracing as far as I can tell. So more reliable, that makes sense. But I still don't see why Bob and proponents of bitboards say you get all of these things for "free". It seems like you still have to do the same work, no matter whether it's in the shift/AND form or the add/if-test form. Reliability is certainly an advantage, but it doesn't account for the claims of people saying you get all of this "free" stuff. Russell
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.