Double Choco is NP-complete
Computational Complexity
2022-03-08 v1
Abstract
In the Nikoli pencil-and-paper game Double Choco, a puzzle consists of an m 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.
Cite
@article{arxiv.2203.02815,
title = {Double Choco is NP-complete},
author = {Dragoljub Đurić},
journal= {arXiv preprint arXiv:2203.02815},
year = {2022}
}