Computer Chess Club Archives

Search

Messages

Subject: Re: algorithm question

Author: Sune Fischer

Date: 00:11:41 09/10/02

Go up one level in this thread

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.

• Re: algorithm question Gerd Isenberg 12:32:04 09/10/02
  • Re: algorithm question Sune Fischer 12:50:32 09/10/02
    • Re: algorithm question Gerd Isenberg 14:39:33 09/10/02
      • Re: algorithm question Gerd Isenberg 14:47:11 09/10/02
• Re: algorithm question Gerd Isenberg 00:18:06 09/10/02

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.