Just one question : how do you extend the concept to a node based graph, rather than cell based map ?
Nice idea, though

>Just one question : how do you extend the concept to a node based graph, rather than cell based map ?
>Nice idea, though

Ahw, i dunno what are you questioning me (''cause my bad english i suppose )
IF you''re questioning me about how i make the beacons + adjacents (they''re like a graph of nodes), first i calculate all the beacons (using a "check corner" algorithm), and next i calculate with bresenhams the adjacent beacons for every beacon (and voilá!, the graph is done )
IF you''re questioning me about extending the "beacons algorithm" to a node based graph... I suppose I can''t extend it, since all the nodes are like "corners", ''cause they discover new ways.

Hoping to be useful
Rodrigo (1/2 RRC²Soft)

My question was your second answer ... I was thinking of what would happen if your method is used in a graph like in Half-Life.
I suppose I could have figured out by reading more carefully

Oops. I should have written better the docs. For an algorithm independent of the start-end point you must use the "check corners" option. This will check first the corners of the map, so the flooding algorithm is unnecessary. Also, without the "check corners" option checked, there''s some wrong pathfinding cases.
If you discovered a map that causes problems with the "check corners" option, please send it to me (in a 256 colors gif)

Thanks.