Author: Sune Fischer
Date: 04:37:57 09/16/02
Go up one level in this thread
On September 16, 2002 at 07:31:43, Sune Fischer wrote: >>An interesting feature of this routines may be looking for all squares >>attackable after all possible moves by the sliders. You only need two >>consecutive calls. > >Yes, that is true, so you can get rid of your 'taxi-distance' table too, just >count the iterations here! > Actually it seems more like a PathDistance function for the sliders (taxi-dist is a bit different). Of course you'll not need many iterations on average to reach the target square. -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.