 These puzzles were used for bar bets in 14th-century Japan,
and a collection of them was published in a Japanese puzzle book from 1727.Determining whether a given puzzle can be solved is NP-complete.This can be proved either by a many-one reduction from 3-satisfiability, or by a parsimonious reduction from the closely related Hamiltonian path problem.