Comments on: Flash Game Developer Tutorial: Pathfinding with Dijkstra’s Algorithm

By: jeiboy

jeiboy — Wed, 13 Oct 2010 21:46:31 +0000

I have a site that all about games and I just want to say thank you for this tutorial..it really helps me a lot.

By: jenjen

jenjen — Wed, 28 Jul 2010 15:48:15 +0000

@Rhuaridh Clark can you please help us to my thesis project,we have to create a maze game using vb.net,and dijtras algo,we’re applyng the algo to computer player(AI),we dont know how we will start to program.

By: undurdysuro

undurdysuro — Thu, 20 May 2010 00:08:27 +0000

Greetings

It is my first time here. I just wanted to say hi!

By: Virgil Wall

Virgil Wall — Tue, 24 Feb 2009 01:45:33 +0000

The table doesn’t seem to match the graphs and the example. Looks like Node A should be T8D at Pass 4, and B should be 8D at Pass 4, etc…
Or more concisely, T9C for Node A at pass 5 doesn’t match the last graphic…. there are no final distances in the example greater than 8.

Yeah, I know… who cares. Good description nonetheless :)

By: Sunil Patel

Sunil Patel — Sat, 20 Dec 2008 00:07:40 +0000

Thanks for making this easy to follow tutorial! I’ve implemented the algorithm, but since it’s for a tile based game I’m having problems with the big pause whilst it works out distance to each node. Perhaps this isn’t the best algorithm for a tile-based game. Interesting nonetheless.

By: jp tiangco

jp tiangco — Thu, 11 Dec 2008 00:19:04 +0000

wow this post is a really huge help. thanks for the effort. i really appreciate posts like these

By: TheNakedDeveloper

TheNakedDeveloper — Wed, 10 Dec 2008 21:18:21 +0000

Interesting indeed, I have been using basic floodfill techniques which is quick and simple but this looks like a new way (for me) to solve some of my problems.

By: Paul Preece

Paul Preece — Wed, 10 Dec 2008 11:06:01 +0000

DTD uses a straight grass burn which solves all exits for all entrances in one go. For node based pathing, Dijkstra’s is the one to use.