Report as inappropriate.
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.
Want to leave a comment? You must first log in.