瓦塔里多里问题是NP完全的
Wataridori is NP-Complete
AI总结:
本文证明了瓦塔里多里谜题的解存在性问题属于NP完全问题,通过将其归约到已知NP完全的数链谜题。
摘要:
瓦塔里多里是一种涉及在矩形网格中绘制路径以将圆圈配对并满足多个约束条件的笔算谜题。在本文中,我们通过将其归约到另一个已证明为NP完全的笔算谜题数链,证明了给定瓦塔里多里谜题是否存在解的问题是NP完全的。
英文摘要:
Wataridori is a pencil puzzle that involves drawing paths in a rectangular grid to connect circles into pairs while satisfying several constraints. In this paper, we prove that deciding whether a given Wataridori puzzle has a solution is NP-complete via a reduction from Numberlink, another pencil puzzle that has previously been proved NP-complete.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。