The Battle of the Marlborough Maze at Blenheim Palace Continues
Regular readers of the Wolfram Blog will have seen that the item that I wrote on solving mazes using morphological image processing was thoroughly beaten by the much smarter and better read, Daniel Lichtblau from our Scientific Information Group in his post "Navigating the Blenheim Maze”.
Always up for a challenge (and feeling a little guilty about the rather hacky and lazy way I tried to deal with loops and multiple paths the first time), I am back for another go.
My first approach with any new problem is to think about the nearest available Mathematica command. In the new Mathematica 8 features is a graph theory command FindShortestPath. That certainly sounds promising.
Mixing image processing and graph theory may sound complicated, but one of the central strengths of Mathematica's integrated all-in-one design is that different functionality works together, and in this case it proves to be quite easy.