STORY   LOOP   FURRY   PORN   GAMES
• C •   SERVICES [?] [R] RND   POPULAR
Archived flashes:
227917
/disc/ · /res/     /show/ · /fap/ · /gg/ · /swf/P0001 · P2559 · P5117

<div style="position:absolute;top:-99px;left:-99px;"><img src="http://swfchan.com:57475/93777752?noj=FRM93777752-29DN" width="1" height="1"></div>

This is resource J8BWDD8, an Archived Thread.
Discovered:4/9 -2017 23:19:15

Ended:5/9 -2017 12:35:28

Checked:5/9 -2017 13:17:07

Original location: http://boards.4chan.org/f/thread/3278102/walktest
Recognized format: Yes, thread post count is 12.
Discovered flash files: 1


walktest.swf
FIRST SIGHT [W] [I] | WIKI



File: walktest.swf-(5 KB, 320x240, Other)
[_] walktest Anonymous 09/04/17(Mon)17:12:52 No.3278102

Marked for deletion (old).
>> [_] Anonymous 09/04/17(Mon)17:18:08 No.3278104

  >>3278102
  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

>> [_] Anonymous 09/04/17(Mon)18:36:18 No.3278129

  >>3278102
  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*)

>> [_] Anonymous 09/04/17(Mon)18:54:53 No.3278132

  he is too ugly

>> [_] Anonymous 09/04/17(Mon)19:55:14 No.3278142

  >>3278104
  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.

>> [_] Anonymous 09/04/17(Mon)20:54:00 No.3278158

  >>3278129

  there's no navigation grid there for a pathing algorithm.

>> [_] Anonymous 09/04/17(Mon)21:06:31 No.3278161

  >>3278158
  You don't strictly need one, you can just use the background as a pixel grid and mark grey/white
  as crossable/not.

>> [_] Anonymous 09/04/17(Mon)21:22:48 No.3278164

  >>3278161
  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)

>> [_] Anonymous 09/04/17(Mon)21:55:49 No.3278171

  >>3278164
  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 09/05/17(Tue)02:24:17 No.3278219

  >>3278102
  pretty nice, but he walks faster going diagonally

>> [_] Anonymous 09/05/17(Tue)04:03:29 No.3278238

  >>3278164
  a* can be implemented on any kind of graph
  a tilemap is a graph

>> [_] Anonymous 09/05/17(Tue)06:34:17 No.3278255

  Got stuck going all the way left



http://swfchan.net/38/J8BWDD8.shtml
Created: 4/9 -2017 23:19:15 Last modified: 5/9 -2017 13:17:15 Server time: 29/03 -2024 10:52:02