The basic algorithm solves by inspection and runs in O(nα(n)) time and O(n) space for n cells. It can solve most but not all stages.
Consider a tree representing where guesses have to be made. For each node, we check its immediate children. If exactly one child is feasible, we continue traversing without counting it towards the depth. Depth-first search (DFS) can explore the tree to depth D in O(n²4Dα(n)) time and O(n + D) space.
The Hamiltonian path problem for general grid graphs is an NP-Complete problem.
These 13 stages cannot be solved, as they break the assumption of a unique solution: 2611, 2672, 2726, 2730, 2745, 2755, 2759, 2821, 2825, 2835, 2845, 2849, 2879
Level 27 and 28 are alternate versions of Level 1: stages 27xx and 28xx are alternate versions of 1xx.