Please use this identifier to cite or link to this item:
http://arks.princeton.edu/ark:/88435/dsp01n583xx609
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Finkelstein, Adam | - |
dc.contributor.author | Wallace, Drew | - |
dc.date.accessioned | 2017-07-20T14:01:24Z | - |
dc.date.available | 2017-07-20T14:01:24Z | - |
dc.date.created | 2017-06-01 | - |
dc.date.issued | 2017-6-1 | - |
dc.identifier.uri | http://arks.princeton.edu/ark:/88435/dsp01n583xx609 | - |
dc.description.abstract | We present a method for the automated generation of playability data in single-player, interactive, deterministic puzzle games, games in which a player must use strategy to decide between multiple moves and use dexterity to correctly execute those moves. We then demonstrate the effectiveness of this method for various applications by performing various analyses of the classic game Tetris. From this analysis we present various new results, including 2D visualizations of the expressive range of Tetris puzzle difficulty, and comparisons of puzzle difficulty under different scoring systems, and more. | en_US |
dc.language.iso | en_US | en_US |
dc.title | Exploring Design Spaces for Tetris | en_US |
dc.type | Princeton University Senior Theses | - |
pu.date.classyear | 2017 | en_US |
pu.department | Computer Science | en_US |
pu.pdf.coverpage | SeniorThesisCoverPage | - |
pu.contributor.authorid | 960864598 | - |
pu.contributor.advisorid | 410075217 | - |
Appears in Collections: | Computer Science, 1988-2020 |
Files in This Item:
File | Size | Format | |
---|---|---|---|
written_final_report.pdf | 540.92 kB | Adobe PDF | Request a copy |
Items in Dataspace are protected by copyright, with all rights reserved, unless otherwise indicated.