Computational Complexity of Yajisan-Kazusan and Stained Glass

Yajisan-Kazusan and Stained Glass are Nikoli’s pencil puzzles. We study the computational complexity of Yajisan-Kazusan and Stained Glass puzzles. It is shown that deciding whether a given instance of each puzzle has a solution is NP-complete.

Authors

Chihiro Iwamoto (ORCID: https://orcid.org/0000-0003-0152-2233)
Ryo TAKAISHI

Institutions

Hiroshima University (JP)

Publication Details

Journal: IEICE Transactions on Information and Systems
Published: 2024-08-15
DOI: https://doi.org/10.1587/transinf.2024fcp0004
Primary Topic: Color Science and Applications
Type: article
Field-Weighted Citation Impact: 0.00

Funders

Japan Society for the Promotion of Science

Controls

|||

ALL TIME

JAN

FEB

MAR

APR

MAY

JUN

JUL

AUG

SEP

OCT

article

Computational Complexity of Yajisan-Kazusan and Stained Glass

Chihiro Iwamoto, Ryo TAKAISHI

Aug 15, 2024

IEICE Transactions on Information and Systems

Color Science and Applications

article

Computational Complexity of Yajisan-Kazusan and Stained Glass

Chihiro Iwamoto, Ryo TAKAISHI

August 15, 2024article en

Abstract

IEICE Transactions on Information and SystemsVol. E108.D(3)

Hiroshima University (JP)

Japan Society for the Promotion of Science

Openalex Percentile: Top 89%

Color Science and Applications

DOI Open Access PDF OpenAlex

AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Computational Complexity of Yajisan-Kazusan and Stained Glass — Chihiro Iwamoto, Ryo TAKAISHI · IEICE Transactions on Information and Systems (2024) | TGRS Research Map | TGRS