A mysterious bandit is on the lam and trying to escape the police who are hot on his trail. His entrance into this part of town is marked with an arrow.
This particular bandit follows a peculiar creed and has vowed never to go backward or turn around. Additionally, whenever he meets an intersection, he will always turn left or right.
Now, as you can see from the map, this part of town has multiple exits, which are labeled A through G. Of all the exits here, which one will the bandit never be able to pass through?
Click a Tab to reveal the Hint.
It's hard to get started on a puzzle that seems to present so many possibilities, but you'd be surprised at how much you can learn by simply trying out the various routes through town.
The paths are littered with twists and turns, but if you try tracing any of the given paths, you can see how the bandit would make his way through town.
To simplify the question, what you're really looking for is an exit that's positioned so that the bandit has to turn away from it every time he draws near.
Do you see any place like that on the map?
If you've tried any of the paths near the entrance the bandit came from, you know that the bandit can escape via A, G, F, and E.
Your answer is one of the other three exits.
This puzzle requires flexible thinking.
As you can see from the diagram, if the bandit must turn every time he approaches an intersection, the ways he can move through the town are set.
As a result, no matter how he approaches B, he'll never be able to leave through there.