Work

Computational Complexity and Integer Programming Formulation of the Oredango Puzzle

Year: 2025

Type: article

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 a 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.

Source: IEICE Transactions on Information and Systems

DOI: 10.1587/transinf.2025fcp0008

Authors: Takuma TAKAHATA, Norito MINAMIKAWA, Takayuki OKUNO

Institutions: Seikei University, Shizuoka Institute of Science and Technology

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond

Funder: Japan Society for the Promotion of Science

Award: 複数の離散凸関数に対する最小化アルゴリズムの研究