Show simple item record

dc.rights.licenseCC-BY-NC-ND
dc.contributor.advisorvan Kreveld, M.J.
dc.contributor.advisorLöffler, M.
dc.contributor.authorPostma, J.O.M.
dc.date.accessioned2017-01-18T18:00:35Z
dc.date.available2017-01-18T18:00:35Z
dc.date.issued2016
dc.identifier.urihttps://studenttheses.uu.nl/handle/20.500.12932/25074
dc.description.abstractThe focus of this thesis lies on the generic evaluation of levels. We believe this is the most crucial component of a generic level generator. We describe three ’generic’ evaluation methods, of which the breaking-rule approach was the most promising. A heuristic is used that predicts the problems the player has to overcome, to solve the level. It uses a restricted input space and breaks certain rules to estimate the distance from a solution. To test the evaluation method, we generated levels for 5 di↵erent puzzles and tested their diculty label in a small experiment. The levels are deemed hard by the experiment, even after generating an easier level set, when most participants could not solve any levels in an hour of play. The solving time and diculty rating the participants gave to the levels has a high correlation with the evaluation scores of the breaking-rule approach.
dc.description.sponsorshipUtrecht University
dc.format.extent13443472
dc.format.mimetypeapplication/pdf
dc.language.isoen
dc.titleGeneric Puzzle Level Generation for Deterministic Transportation Puzzles
dc.type.contentMaster Thesis
dc.rights.accessrightsOpen Access
dc.subject.keywordsGeneric, Puzzle, Level, Generation, Transportation, Difficulty
dc.subject.courseuuComputing Science


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record