NP-completeness of two pencil puzzles: Yajilin and Country Road
Abstract
Two pencil puzzles, Yajilin and Country Road, are shown NP-complete. Modified versions of the Hamiltonian cycle problem on planar undirected graphs are reduced to the puzzle problems to show NP-hardness.











