Find a path from the bottom left to the top right passing through every white square exactly once. Your path must alternate horizontal and vertical segments, and two consecutive segments can not be the same length. Below is a solved example. Each puzzle has a unique solution. All puzzles copyright Erich Friedman, 2006.