anyone to review this?

[stefanhendriks]

yes, i saw the PS3 thingy at gamespot (2 hours long, yep). And i saw killzone there, omg.... it looks very neat.

[Lazy]

Looks good, the only thing I can suggest is a more detailed explanation of the floyd-warshall algorithm - unless I'm the only one not getting it o_O.

Say we have a byte array of a map, with values ranging from 0 ( open ) and 1 ( closed ).
If we want to find out if map[ x ][ y ] is a neighbour to map[ x + 1][ y ] how do we go about finding this out?
I'm guessing that CanGoTo just checks if map[ x + 1 ][ y ] is open?

Sorry if those are stupid questions, I tried looking for more on it but found next to nothing useful.
Good work on the article though, lots of useful info that will be put into use in the future .

[@$3.1415rin]

floyd warshall is used to get a path to another waypoint, or to get the distance between 2 waypoints. if a waypoint is a neighbor to another waypoint - you should be able to get this information from your world representation, that is for example from your waypoints which contain information to which they are connected.

[Pierre-Marie Baty]

To understand the floyd-warshall algorithm I advise you to pay attention to the code comments much more than the actual text that's supposed to explain it