Author: Andreas Rueckert
Date: 00:24:56 04/18/03
Go up one level in this thread
I don't do Assember or Pascal, but one option might be a lookup table, where you store the numbers for all possible byte values (0 -255). The total number then would be: setbits[num & 255] + setbits[ (num >> 8) & 255] + ... You get the concept I guess... HTH, Andreas
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.