Author: Gerd Isenberg
Date: 00:18:06 09/10/02
Go up one level in this thread
On September 10, 2002 at 03:11:41, Sune Fischer wrote: >On September 10, 2002 at 03:06:48, Gerd Isenberg wrote: > >>Thanks, Tony >> >>i have it now. It's a floodfill algorithm. >> >>Gerd > >I wonder if it is possible to optimize it by running the squares against each >other to meet at half way? >Doesn't seem doable though, if we mask the squares onto the same board we can do >both operations in one go, but then there is no way to check for contact:( > >-S. Hi Sune, yes i already thought about it in my initial recursive one. But had some difficulties with bookholding. regards, Gerd
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.