I hated depth-first-search back in Algorithms in undergrad but as soon as they said "Do pathfinding for a video game" I was all over that.
-
-
@patio11 Cool solution, cool game, thanks! I did a wall-following robot, somewhat simpler :) https://gist.github.com/anonymous/f8ed4a6155dd1ac20bd6 … -
@rumpuslabs I was going to do that but couldn't remember if "Keep your right hand on the wall and you WILL get out" works in all mazes. - 1 more reply
New conversation -
-
-
@patio11 lazy roboticist's solution to untrusted level 13: drive with R or 5, steer with the phone: https://gist.github.com/swolchok/4b42a854dfca979573e5 …Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
@patio11 DFS is actually a pretty bad approach for path-finding in games. Use Dijkstra and its improvements, notably A*Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
@patio11 I cribbed the moveToward function from a few levels back and combined: https://gist.github.com/DanLuchi/33db49e4f74926179e37 …. Awesome game, thanks for sharing!Thanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.