Author: Sune Fischer
Date: 08:56:00 09/10/02
Go up one level in this thread
On September 10, 2002 at 11:35:54, Vincent Diepeveen wrote: >On September 09, 2002 at 19:01:17, Gerd Isenberg wrote: > >But looking for a path from A to B in the shortest way, >visiting points X Y Z ... , this is a science in itself. > >I assume you know this? > >There is loads of theory about it. If you count the iterations done by the floodfiller, you have the distance of the shortest path. I think the floodfiller has even more potential, I believe it can be modified to do only diagonal or straight lines, so one might use it to check for trapped rooks and bishops, even detecting holes in the pawn shelter for the king safety should be possible. Of course, you are not a bitboarder, so.... ;) -S.
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.