Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: All shortest paths & other flood-fill based algorithms

Author: Steffan Westcott

Date: 09:47:23 09/14/02

Go up one level in this thread


On September 14, 2002 at 11:56:41, Heiner Marxen wrote:

>It is much more:  every "real" bottleneck is also a shortest path bottleneck.
>Hence, the above bottleneck test done on all single bit intermediate bitboards
>exactly detects all real bottlenecks.  Cute!


Spot on Heiner, I actually missed that one! Job done!

Cheers,
Steffan



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.