Author: Robert Hyatt
Date: 18:35:48 12/08/98
Go up one level in this thread
On December 08, 1998 at 19:05:52, Marc wrote: >I noticed in the previous thread about bitboard vs. integer array performance >that both approaches were considered equally efficient on non-64 bit-based >processors. > >Even so, I thought bitboards provided a significant speed improvement over int >arrays in both move-generation and position evaluations, i.e. quickly checking >for forks. > >Any thoughts from the bitboard camp? Bitmaps work fine for some things. I know of no better way to generate captures because there are no unnecessary loops over empty squares. But they take a beating in other places, such as finding the first 1 bit set, for example... or counting bits set... at present I see nothing that says they are better or worse than offset programs, *until* we get to 64 bit architectures. Then the offset programs have to struggle to keep up due to information "density" issues...
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.