|
Accursed Walrus posted:
The trick to these is to work out which parts of the path you don't take. Whenever you have three segments meeting at a point, you can only take 2 of them. Likewise you can only take one segment at the entrance and exit. There are fourteen places where three segments meet at a point, and each segment connects two places, so (counting the entrance and exit too) there are eight segments you won't take. Make sure these are all as short as possible and you solve the puzzle.
|
# ¿ Jan 21, 2015 02:01 |
|
|
# ¿ Apr 27, 2024 03:18 |
|
Accursed Walrus posted:Huh, I never noticed that. That method works a lot better than the one I used. Go right ahead!
|
# ¿ Jan 21, 2015 17:25 |