Author: Gian-Carlo Pascutto
Date: 05:45:16 10/13/01
Go up one level in this thread
On October 13, 2001 at 08:05:49, Alvaro Jose Povoa Cardoso wrote: >What is the fastest way to count the bits in a heavily populated bitboard? >When I say heavy I mean a 10-24 bit count situation. >Should I use a lookup table for this particular case? If the board is heavily populated and you have a Pentium III or better, take a look at my MMX bitcount routine. It runs fully paired in the MMX units, without branches. I don't have the code handy but I'm sure Dann has it lying around somewhere. -- GCP
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.