A* (A-Star) Pathfinding Example

Edit: This video is OLD! Check out my new AStar videos and there are links to the application and source code inside the info for them.

New Videos:

Part 1: http://www.youtube.com/watch?v=Kw8AMmyc6vg
Part 2: http://www.youtube.com/watch?v=uIVu7ViLaZo
Part 3: http://www.youtube.com/watch?v=kcYkd1Oxnrc

Thanks.

(This was an initial protoype of the AStar algorithm I had made as a proof of concept to myself, this video is poor quality and old, check out my new ones.)

Category:

Education

Tags:

• A*
• computer
• science
• math
• Star
• AStar
• A-Star
• programming
• C#
• .NET
• algorithm
• path
• finding
• pathfinding

[mahmad191]

Are u australian??

[Dooobs]

@mahmad191 Yeap, surely am!

[igalEpshtein]

looks like great job

is there a source code somewhere ?

[Dooobs]

Look at my other videos, link in the sidebar.

[BurningFeetMan]

Hey Dooobs,

Awesome work! Great stuff. :)

[Dooobs]

Thanks mate!

[Timba246]

this video has 2 flaws

1 it displays only two first digits of H score/ this is confusing

2 your heuristic (H score) seems to be manhattan_distance^2 which is not admissible heuristic (see A* algorithm) so found path is not guaranteed to be optimal. set H to manhattan_distance for example to make found paths optimal

[igalEpshtein]

didnt find any source code link over there

[igalEpshtein]

hey,

can you provide the source code of it ? PLS

besides, looks like you did a good job