Draw a path that starts at S and finishes at F that goes through each blank hex at most once. The path can only change direction when it hits a black hex, a hex that contains part of the existing path, or the edge of the grid. The path must dead end at F, meaning no continuation of the path is possible. A solved puzzle is shown below.
Each puzzle below has a unique solution. All puzzles copyright Erich Friedman, 2007.