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.
The algorithm I'm thinking of follows the right hand path all the time, marking where it goes. To get the no-dead-ends route, take the left hand path the whole time without leaving the marked path.
|
|
Posted by Tristan
on 2004-06-21 15:51:06 |
cool solution
