Solving simple curved nonograms
Acta Informatica · 2026-12 · 63 (4)
DOI: 10.1007/s00236-026-00536-z ↗Kurz gefasst
Fachartikel in der Zeitschrift Acta Informatica, online erschienen am 19.11.2026. Verfasst von Soeren Terziadis und 3 weiteren Autor:innen. Die Arbeit nennt 39 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Nederlandse Organisatie voor Wetenschappelijk Onderzoek.
Abstract (Originalsprache)
Nonograms are a popular type of puzzle, where an arrangement of curves in the plane (in the classic version, a rectangular grid) is given together with a series of hints, indicating which cells of the subdivision are to be colored. The colored cells yield an image. Curved nonograms use a curve arrangement rather than a grid, leading to a closer approximation of an arbitrary solution image. While there is a considerable amount of previous work on the natural question of the hardness of solving a classic nonogram, research on curved nonograms has so far focused on their creation, which is already highly non-trivial. We address this gap by providing algorithmic and hardness results for curved nonograms of varying complexity.
Förderung
- Nederlandse Organisatie voor Wetenschappelijk Onderzoek
Zitieren
APA
Terziadis, S., Weinberger, A., Löffler, M., & Rote, G. (2026). Solving simple curved nonograms. Acta Informatica, 63(4). https://doi.org/10.1007/s00236-026-00536-z
Vancouver
Terziadis S, Weinberger A, Löffler M, Rote G. Solving simple curved nonograms. Acta Informatica. 2026;63(4). doi:10.1007/s00236-026-00536-z
BibTeX
@article{Terziadis2026,
author = {Terziadis, Soeren and Weinberger, Alexandra and Löffler, Maarten and Rote, Günter},
title = {Solving simple curved nonograms},
journal = {Acta Informatica},
year = {2026},
volume = {63},
number = {4},
doi = {10.1007/s00236-026-00536-z}
}
EUVIMED