Introduction - If you have any usage issues, please Google them yourself
Romeo and Juliet maze. Romeo and Juliet live in a maze mn, as shown. Each box represents a maze of rooms. This mn rooms in some of the rooms are closed, do not allow anyone to enter. Not enter a closed room at any location along the maze of eight directions. Romeo is located in the maze (p, q) grid, he must find a path to Juliet where (r, s) grid road. Before arriving Juliet, he must not traveled all closed room each time, and Juliet' s turn to make to reach the number of the least. Every change in the direction counted once turning once. Please help design and implement an algorithm Romeo find such a path.