Hint 1
First off, ignore 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.
The local museum has an exhibit that spans nine rooms, as shown in the diagram below. The entrance to the complex is marked A and the exit is marked B.
The security guard on duty is a bit lazy 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.

First off, ignore 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.
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.
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.
2
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.
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!

Hints you open and puzzles you mark solved are kept in this browser.