Maze-shrinker: minimal representation of a maze as a graph #120
Labels
enhancement
New feature or request
shared
Code common to all libraries
squashedmaze
A squashed representation of a maze into a minimal graph.
Write an algorithm that takes a maze and shrinks it down to the minimal graph that describes it. This will consist of:
One vertex for all cells of degree 1, 3, and 4: 1 represents a dead end, 3 represents a T juncture, and 4 represents a + juncture.
Edges as appropriate, with weights being the number of cells in the original maze.
The text was updated successfully, but these errors were encountered: