Given a two dimentional maze which only has one path from entrance to exit, develop an algorithm that discovers the no-dead-ends route from start to finish.
As long as you can, pick any dead end, and start blacking it out until you reach an intersection.
When no more dead ends are left, the path will be the only not blackened road.