|←||055 - The Odd Sandwich||056 - The Lazy Guard||057 - Cut Which One?||→|
The local museum has an exhibit that spans nine rooms, as shown in the diagram below. The entrance to the complex is marked by A, and the exit is marked by B.
The security guard on duty is a bit of a loafer and wants to walk each room of the exhibit while turning as few times as possible. What is the fewest number of turns he can make while still visiting every room?
As an example, the diagram below shows a course that involves six turns.
Give it another shot!
The puzzle shows you an example on purpose. Sometimes seeing an example keeps people from thinking creatively. Don't get stuck in a rut.
If the security guard takes a path like the one shown above, he can finish his patrol of all nine rooms in just two turns.
- US Version
Since the example shows the guard turning right angles to go from room to room, it's easy to assume that your solution works the same way even though that's not the case.
- UK Version
It's easy to be influenced by the fact that the example path shows the guard turning right angles to go from room to room, but you don't need to follow that example!
|Professor Layton and the Curious VillagePuzzles in|
See here for weekly puzzles
|Puzzle Index: CV · DB · UF · LS · MM · AL · VS|
A big thanks to http://professorlaytonwalkthrough.blogspot.com