This site requires JavaScript, please enable it in your browser!
Greenfoot back
Twitter Twitter.hover

Report as inappropriate.

nccb
nccb presents ...

2012/5/17

Pathfinding

This scenario uses a fairly dumb brute-force search to find all the paths around a grid world (with no diagonal movement). For an explanation, see this blog post: http://sinepost.wordpress.com/2012/05/17/finding-your-way-around/

Run the scenario and then move your mouse over a square to see all the shortest paths to that square.

7637 views / 25 in the last 7 days

5 votes | 0 in the last 7 days

Tags: with-source

open in greenfoot
Your browser does not support the canvas tag.
Embed | View applet version
GazzzahGazzzah

2012/5/17

Nicely done!
matt.milanmatt.milan

2012/5/18

it's easy to see how useful this is for ai actor movement logic but i wonder what other applications it may have. very interesting stuff
MatheMagicianMatheMagician

2012/10/7

I used your pseudo code to develop my tower defense game. Your blog is awesome! Very nice way of doing it.
MatheMagicianMatheMagician

2012/10/7

The pathfinding I mean.

Want to leave a comment? You must first log in.

Who likes this?

Firewall ShoutToUs -nic- bkellermann MatheMagician