Show simple item record

dc.rights.licenseCC-BY-NC-ND
dc.contributor.advisorKreveld, M.J. van
dc.contributor.advisorLöffler, M.
dc.contributor.authorKerkhof, M.A. van de
dc.date.accessioned2017-12-19T18:01:50Z
dc.date.available2017-12-19T18:01:50Z
dc.date.issued2017
dc.identifier.urihttps://studenttheses.uu.nl/handle/20.500.12932/28187
dc.description.abstractIn this thesis we propose a new algorithm for automatically generating curved nonograms, which are a variation on the popular nonogram puzzle. Aside from a core algorithm, several optional features are introduced which can modify the algorithm to try and generate curved nonograms that best fulfill the aesthetic requirements for publishing.The core algorithm and additional features are tested on several different input images. We find that the algorithm is able to generate usable puzzles in many cases. Some of the optional features prove to be promising, but require further study and adjustment to get their desired effect.
dc.description.sponsorshipUtrecht University
dc.format.extent1851665
dc.format.mimetypeapplication/pdf
dc.language.isoen
dc.titleImproved Automatic Generation of Curved Nonograms
dc.type.contentMaster Thesis
dc.rights.accessrightsOpen Access
dc.subject.keywordspuzzles, nonograms, geometry, algorithms, simulated annealing
dc.subject.courseuuComputing Science


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record