Path Finder is a logic puzzle where you must draw a continuous path that visits every cell on the grid exactly once. Starting from a designated cell, you extend the path one step at a time in cardinal directions, aiming to cover the entire board without revisiting any cell or getting stuck in a dead end. The concept is based on the Hamiltonian path problem, a foundational challenge in graph theory and computer science. Small grids offer a gentle introduction, while larger boards require deep lookahead thinking and backtracking strategies. Later puzzles add walls and arrow cells, which must be left in the arrow's direction, and every Hard puzzle has exactly one solution. It is a deeply satisfying puzzle that rewards patience and systematic exploration.