Each square grid below contains a path from every numbered square to some meeting point. The number in each square tells how many straight line segments it takes to get to the meeting point. The different paths to the meeting point cannot intersect, and can only go horizontally and vertically through the grid squares. The meeting point must be in an empty square. Below is a solved example. Each puzzle below has a unique solution. All puzzles copyright Erich Friedman, 1998.