Tatamibari是NP完全的
Tatamibari is NP-complete
摘要:
在Nikoli的纸和纸游戏Tatamibari中,谜题由$m \times n$网格单元组成,其中每个单元可能包含+,-,|.目标是将网格划分为不相交的矩形,其中每个矩形只包含一个线索,包含+的矩形是正方形,包含-的矩形严格地水平比垂直长,包含|垂直长度严格大于水平长度,并且没有四个矩形共用一个角。我们证明了这个难题是NP完全的,建立了一个16年的尼古拉差距。一路上,我们介绍了一个小工具框架,用于证明涉及面积覆盖的类似难题的硬度,并表明它适用于现有的NP-硬度证明螺旋镀锌。我们还提出了一个数学拼图字体的Tatamibari。
英文摘要:
In the Nikoli pencil-and-paper game Tatamibari, a puzzle consists of an $m \times n$ grid of cells, where each cell possibly contains a clue among +, -, |. The goal is to partition the grid into disjoint rectangles, where every rectangle contains exactly one clue, rectangles containing + are square, rectangles containing - are strictly longer horizontally than vertically, rectangles containing | are strictly longer vertically than horizontally, and no four rectangles share a corner. We prove this puzzle NP-complete, establishing a Nikoli gap of 16 years. Along the way, we introduce a gadget framework for proving hardness of similar puzzles involving area coverage, and show that it applies to an existing NP-hardness proof for Spiral Galaxies. We also present a mathematical puzzle font for Tatamibari.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。