File: walktest.swf-(5 KB, 320x240, Other)
[_] walktest Anon 3278102 Marked for deletion (old).
>> [_] Anon 3278104 >># neat, but I'd give the area a -1 of whatever and move the picture of the floor a bit higher since when you stand at the top you go out of the map but it looks good when you're standing at the bottom
>> [_] Anon 3278129 >># look up Dijkstra's algorithm if you'd like your pathing to go _around_ the walls to get to it's destination (or look up A*)
>> [_] Anon 3278132 he is too ugly
>> [_] Anon 3278142 >># I think he's doing the Zelda deal, where it's not top-down but rather at an angle. In which case he probably should've marked it, but it's a test, so whatever.
>> [_] Anon 3278158 >># there's no navigation grid there for a pathing algorithm.
>> [_] Anon 3278161 >># You don't strictly need one, you can just use the background as a pixel grid and mark grey/white as crossable/not.
>> [_] Anon 3278164 >># just looked into that algorithm. it's only as2 level scripting so hitTest'ing the whole map will be inefficient as tits. I'm thinking of "crawling" along the grey edge to find any straight lines to the target point, but i have no idea if I can even program that (i'm a shit programmer)
>> [_] Anon 3278171 >># Edge crawling wouldn't be hard to write and there are multiple ways to do it. The difficult(tedious) part would be finding the shortest path to the destination point as you would need to predetermine all applicable routes.
>> [_] not john moses browning, hes a huge faggot 3278219 >># pretty nice, but he walks faster going diagonally
>> [_] Anon 3278238 >># a* can be implemented on any kind of graph a tilemap is a graph
>> [_] Anon 3278255 Got stuck going all the way left