A Framework for Loop and Path Puzzle Satisfiability NP-Hardness Results

02/04/2022

∙

by   Hadyn Tang, et al.

∙

0

∙

share

Building on the results published in arxiv:2004.12849 we present a general framework for demonstrating the NP-hardness of satisfying many genres of loop and path puzzles using a 'T-metacell' gadget. We then use this to prove the NP-completeness of a variety of such genres, and discuss some of the limitations of this gadget.