Find a path, moving horizontally, vertically, or diagonally, that starts in the lower left square and finishes in the upper right square. The path should pass through every white square exactly once, and not pass through any black squares. The sequence of the number of squares moved in each direction from the start to the finish should read the same forward or backward. A sample puzzle is shown below.
Each puzzle below has a unique solution. All puzzles copyright Erich Friedman, 2010.