Innovative Maze Solving with Mathematica

A typical data structures assignment involves using stacks/queues to generate/solve mazes. This is usually performed by variants of BFS or DFS. As many of my students are currently busy with this task, I thought of presenting them a number of nontraditional solutions incorporating a real world example and some advanced techniques.

There has been a series of posts on a this problem on the Wolfram blog attacking the hedge maze at the Blenheim Palace. The solutions presented started with processing the aerial image acquired from Bing Maps, and proceeded to explore a variety of techniques from standard graph theory to a twisted application of topology.

The series progressed as follows:

• aMAZEing Image Processing in Mathematica


• Navigating the Blenheim Maze


• The Battle of the Marlborough Maze at Blenheim Palace Continues


• Retreat from Blenheim

Hope you find it interesting!