Design and Automated Generation of Japanese Picture Puzzles
Publication date
2019-05-01
Authors
van de Kerkhof, M.A.
de Jong, Tim
Parment, Raphael
Löffler, Maarten
Vaxman, A.
van Kreveld, M.J.
Editors
Advisors
Supervisors
Document Type
Article
Metadata
Show full item recordCollections
License
taverne
Abstract
We introduce the generalized nonogram, an extension of the well-known nonogram or Japanese picture puzzle. It is not based on a regular square grid but on a subdivision (arrangement) with differently shaped cells, bounded by straight lines or curves. To generate a good, clear puzzle from a filled line drawing, the arrangement that is formed for the puzzle must meet a number of criteria. Some of these relate to the puzzle and some to the geometry. We give an overview of these criteria and show that a puzzle can be generated by an optimization method like simulated annealing. Experimentally, we analyze the convergence of the method and the remaining penalty score on several input pictures along with various other design options.
Keywords
Applied computing → Computer games, CCS Concepts, Human-centered computing → Visualization systems and tools, Taverne, Computer Graphics and Computer-Aided Design
Citation
van de Kerkhof, M, de Jong, T, Parment, R, Löffler, M, Vaxman, A & van Kreveld, M 2019, 'Design and Automated Generation of Japanese Picture Puzzles', Computer Graphics Forum, vol. 38, no. 2, pp. 343-353. https://doi.org/10.1111/cgf.13642