CV056 - The Lazy Guard

«  The Odd Sandwich
The Lazy Guard
Cut Which One? »

The Lazy Guard
Puzzle Number 056
Puzzle Name The Lazy Guard
Picarats Given 30 Picarats
Type Write Answer
Location Entrance
Previous Puzzle CV055 - The Odd Sandwich
Next Puzzle CV057 - Cut Which One?

This is the fifty-sixth puzzle that appears in Professor Layton and the Curious Village. To access this puzzle, you must talk to Stachenscarfen. In order to solve this puzzle, you must determine the fewest number of turns the guard can take to go through all rooms.


[edit] Hints

Hint One
    First off, pay no mind to the sample path shown on the screen.

    Here's an additional hint for you. Nowhere within the problem does it say the guard can only enter each room once. It's OK for your path to move back through a previously visited room.

Hint Two
    Has the layout of the rooms and the sample path shown made you feel like all your turns need to be 90 degrees?

    This puzzle wants you to find the solution with the fewest number of turns. This means that movement will always be in a straight line, but the angle of any given turn is up to you.

Hint Three
    There's no reason the guard should have to enter the exhibit at an angle parallel to the room. Consider a path that starts with the guard entering from a 45-degree angle.

    Don't forget, you can move through the same room twice.

[edit] Messages

[edit] When Failed

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.

[edit] When Completed

That's right!

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.

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.

[edit] Solution


The guard can take just two turns.

[edit] Progress

1925 Picarats and 110 Hint Coins.

Last edited by Squiggle on 29 December 2015 at 02:37
This page has been accessed 1,982 times.