Computational Complexity and Integer Programming Formulation of the Oredango Puzzle
Computational Complexity
2025-03-14 v1
Abstract
Oredango puzzle, one of the pencil puzzles, was originally created by Kanaiboshi and published in the popular puzzle magazine Nikoli. In this paper, we show NP- and ASP-completeness of Oredango by constructing a reduction from the 1-in-3SAT problem. Next, we formulate Oredango as an 0-1 integer-programming problem, and present numerical results obtained by solving Oredango puzzles from Nikoli and PuzzleSquare JP using a 0-1 optimization solver.
Cite
@article{arxiv.2503.10393,
title = {Computational Complexity and Integer Programming Formulation of the Oredango Puzzle},
author = {Takuma Takahata and Norito Minamikawa and Takayuki Okuno},
journal= {arXiv preprint arXiv:2503.10393},
year = {2025}
}
Comments
12 pages