The rules of the game below are as follows:
With optimal play, what is the least number of squares you can move onto (excluding the blue square you're already on) in order to reach the goal?
This problem was inspired by the game Swim Out .
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
The 4th row has both a stick, a yarn and doesn't have and pets moving horizontally on it, thus making it the optimal route
This is how I worked out his problem in paint