Draw a continuous path visiting every cell exactly once
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. Some puzzles include numbered hints that tell you the order in which certain cells must be visited, adding an extra layer of constraint satisfaction. It is a deeply satisfying puzzle that rewards patience and systematic exploration.