Find a path consisting of straight lines that visits each circle once, and does not cross itself. A number n in a circle indicates that it is the nth circle visited. For example, a solved puzzle is shown below. Each puzzle below has a unique solution. All puzzles copyright Erich Friedman, 2008.