Author: Koundinya Veluri
Date: 16:55:19 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? > >Thank you, >Alvaro Cardoso Take a look at this site: http://supertech.lcs.mit.edu/~heinz/dt/node7.html That's how DarkThought did it and the second one works very well in my program for large populations. It took me a couple of hours to understand how it works, but it's really cool :) Koundinya
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.