arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2203.02815cs.CC
收藏

Double Choco是NP完全的

Double Choco is NP-complete

Dragoljub Đurić

摘要:

在Nikoli的纸与纸游戏Double Choco中,谜题由m $\times$ n网格组成,网格由白色或灰色的单元格组成,由虚线分隔,每个单元格可能包含一个整数。目标是通过在虚线上绘制实线将网格划分为块,其中每个块必须包含一对具有相同形式(大小和形状)的白色和灰色单元的区域。整数表示块中该颜色的单元格数。一个块可以包含任意数量的整数单元格。我们证明了这个难题是NP完全的,建立了2年的尼古拉差距。

英文摘要:

In the Nikoli pencil-and-paper game Double Choco, a puzzle consists of an m $\times$ n grid of cells of white or gray color, separated by dotted lines where each cell possibly contains an integer. The goal is to partition the grid into blocks by drawing solid lines over the dotted lines, where every block must contain a pair of areas of white and gray cells having the same form (size and shape). An integer indicates the number of cells of that color in the block. A block can contain any number of cells with the integer. We prove this puzzle NP-complete, establishing a Nikoli gap of 2 years.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑