Start at 1 (bottom left), and visit all the numbers in order, finishing at 9 (top right).
Give yourself a special prize if use 257 steps or less!
I'm still working on all methods... There's some more interesting mazes to come.
Puzzling Stack Exchange is a question and answer site for those who create, solve, and study puzzles. It only takes a minute to sign up.
Sign up to join this communityStart at 1 (bottom left), and visit all the numbers in order, finishing at 9 (top right).
Give yourself a special prize if use 257 steps or less!
I'm still working on all methods... There's some more interesting mazes to come.
Well it gets a bit messy, but here is the solution:
![]()
I have colour coded it to make it easier to follow:
1 -> 2 = red
2 -> 3 = dark blue
3 -> 4 = green
4 -> 5 = orange
5 -> 6 = light blue
6 -> 7 = pink
7 -> 8 = yellow
8 -> 9 = purple
Step count:
(Split by the colours):
33 + 19 + 55 + 31 + 30 + 38 + 18 + 33 = 257 steps
Exactly 257 steps as required! I don't believe it is possible in less, unless I am missing something obvious
Bit of feedback:
I like the concept, but this was slightly messy. There is no real easy way to display an answer, and even with colour coding we get cases where 4 lines are parallel and you cant even see the arrows. I would recommend trying to not place checkpoints where you have to go over the same path or it does get messy.
Another confusing thing here, is to visit the numbers in order we actually have to visit them out of order. For instance, to visit 5 we have to pass through 8 and 3 gets passed through multiple times. Would also recommend checkpoints which only should be visited once, and perhaps even enforcing this as a rule.
Keep going though! Mazes are a light, fun challenge to complete.