Author: Gerd Isenberg
Date: 15:19:22 12/03/02
Go up one level in this thread
<snip>
>while (bb)
> doSomething( bitSearchAndReset(bb) );
>
>If i would do it in that way, your approach may preferable:
That's what i meant.
Otherwise your approach is clearly perferable ;-)
int squares[64+1];
for (int i=0; bb; ++i)
squares[i] = bitSearchAndReset(bb);
squares[i] = 64;
for (i=0; squares[i]<64; ++i)
doSomething( squares[i] );
This page took 0.01 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.