Examine the picture below. It is an example of a solution to the
5x5 self avoiding walk problem. Given a 5x5 grid, start in the lower
left and visit each point once without visiting any point twice and
using only horizontal and vertical moves. The solution below makes 11
turns. Find a solution with the largest possible number of turns
(there are several possible correct answers).
Send your answer to email@example.com
Back to Problems