Each square on a 5 x 5 grid--except for the central square--has a food pellet in it. A long, thick snake crawls out of the hole in the central square and moves around the grid, collecting the pellets.
The snake is so thick (almost 1-block thick) that it cannot move past a cell which is already occupied by part of his body. For example, in the diagram, the snake can only collect the 12 food pellets above and right of the central square, ultimately being stuck in the upper right corner since it cannot go any further.
Starting afresh, can the snake cleverly find its way to all 24 of the pellets?
Details and Assumptions:
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.
There are multiple solutions, compounded by the fact that the grid is symmetrical
Here is one such solution: