关于满足某些路和圈问题的NP-完全性
On the NP-Completeness of Satisfying Certain Path and Loop Puzzles
摘要：
“无眼”、“海粟”和“东方之家”是胡威廉发明的逻辑谜题类型，“绕道”是在线用户张国文发明的逻辑谜题类型。每一个谜题都围绕着根据网格中的线索给出的某些约束，在网格的单元格中构建一条路径或循环。我们证明，决定是否在这些类型的一个特定的难题是可解的是NP完全的。
英文摘要：
"Eye-Witless", "Haisu" and "Oriental House" are genres of logic puzzles invented by William Hu, and "Detour" is a genre of logic puzzle invented by online user Guowen Zhang. Each of these puzzles revolves around constructing a path or loop through the cells of a grid according to certain constraints given by clues in the grid. We prove that deciding whether a particular puzzle in each of these genres is solvable is NP-complete.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
