Author: Steffan Westcott
Date: 14:22:17 09/13/02
Go up one level in this thread
On September 13, 2002 at 16:56:38, Steffan Westcott wrote:
>In your version, each set bit in sq1 can fill at most 6 neighbours per
>iteration. With my very slight rearrangement of your code, each set bit in sq1
>can now fill at most 9 neighbours per iteration, with no loss of speed.
^^^^^^^^^^^^
Sorry, that should read 8 neighbours.
Cheers,
Steffan - evidently having problems counting today :*)
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.