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 idea is to always turn left first. This will get you to the end eventually, but with dead ends. To avoid dead ends, retrace the path backwards but only turning left.
Regards,
wcaexqdz
|
|
Posted by wcaexqdz
on 2004-10-23 07:07:02 |
Solution
