Double Choco is NP-complete

03/05/2022
by   Dragoljub Đurić, et al.
0

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.

READ FULL TEXT

page 6

page 12

page 14

page 21

research
03/18/2020

Tatamibari is NP-complete

In the Nikoli pencil-and-paper game Tatamibari, a puzzle consists of an ...
research
09/06/2019

NP-completeness of the game Kingdomino

Kingdomino is a board game designed by Bruno Cathala and edited by Blue ...
research
08/30/2017

The Painter's Problem: covering a grid with colored connected polygons

Motivated by a new way of visualizing hypergraphs, we study the followin...
research
02/07/2022

Uncertainty in Grid Data: A Theory and Comprehensive Robustness Test

This article makes two novel contributions to spatial political and conf...
research
05/13/2020

An improved solution approach for the Budget constrained Fuel Treatment Scheduling problem

This paper considers the budget constrained fuel treatment scheduling (B...
research
07/19/2022

All Paths Lead to Rome

All roads lead to Rome is the core idea of the puzzle game Roma. It is p...
research
05/02/2019

Benchmark Instances and Branch-and-Cut Algorithm for the Hashiwokakero Puzzle

Hashiwokakero, or simply Hashi, is a Japanese single-player puzzle playe...

Please sign up or login with your details

Forgot password? Click here to reset