{"id":{"repo_id":"mit","oai_identifier":"oai:dspace.mit.edu:1721.1/55113"},"canonical_url":"https://search.dev.ndltd.org/etd/mit/oai:dspace.mit.edu:1721.1/55113","repository":{"repo_id":"mit","name":"MIT","base_url":"https://dspace.mit.edu/oai/request"},"display":{"title":"Applying quantitative models to evaluate complexity in video game systems","abstract":"This thesis proposes a games evaluation model that reports significant statistics about the complexity of a game's various systems. Quantitative complexity measurements allow designers to make accurate decisions about how to manage challenge, keeping in mind the player's physical and mental resources and the amount/type of actions the game requires players to act upon. Managing the operational challenge is critical to keeping players in a state of enjoyment, the primary purpose of video games. This thesis first investigates the relationship between enjoyment and complexity through the concept of Flow. From there it examines the properties of GOMS that are useful to analyzing videogames using Tetris as a case study, and then it examines and dissects the shortcomings of a direct usability approach and offers solutions based on a strategy game example. A third case study of the idle worker scenario in strategy games is detailed to further corroborate the usefulness of applying a GOMS based analysis to videogames. Using quantitative measurements of complexity, future research can aggressively tackle difficulty and challenge precisely, mitigate complexity to widen market appeal, and even reveal new genre possibilities.","abstract_html":"This thesis proposes a games evaluation model that reports significant statistics about the complexity of a game's various systems. Quantitative complexity measurements allow designers to make accurate decisions about how to manage challenge, keeping in mind the player's physical and mental resources and the amount/type of actions the game requires players to act upon. Managing the operational challenge is critical to keeping players in a state of enjoyment, the primary purpose of video games. This thesis first investigates the relationship between enjoyment and complexity through the concept of Flow. From there it examines the properties of GOMS that are useful to analyzing videogames using Tetris as a case study, and then it examines and dissects the shortcomings of a direct usability approach and offers solutions based on a strategy game example. A third case study of the idle worker scenario in strategy games is detailed to further corroborate the usefulness of applying a GOMS based analysis to videogames. Using quantitative measurements of complexity, future research can aggressively tackle difficulty and challenge precisely, mitigate complexity to widen market appeal, and even reveal new genre possibilities.","abstract_has_math":false,"creators":["Tanwanteng, Matthew (Matthew E.)"],"institution":"Massachusetts Institute of Technology","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.","school":null,"contributors":[],"advisors":["Robert C. Miller."],"committee_chairs":[],"committee_members":[],"year":2009,"date_issued":"2009","date_published":"2009","updated_at":"2026-07-22T22:21:34Z","subjects":["Electrical Engineering and Computer Science."],"languages":["eng"],"rights":["M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission."],"rights_urls":["http://dspace.mit.edu/handle/1721.1/7582"],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/1721.1/55113","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Robert C. Miller."]},{"key":"dc:contributor.department","label":"Department","values":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."]},{"key":"dc:contributor.other","label":"Dc Contributor Other","values":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."]},{"key":"dc:creator","label":"Author","values":["Tanwanteng, Matthew (Matthew E.)"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2010-05-25T20:43:53Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2010-05-25T20:43:53Z"]},{"key":"dc:date.issued","label":"Date","values":["2009"]},{"key":"dc:publisher","label":"Institution","values":["Massachusetts Institute of Technology"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Electrical Engineering and Computer Science."]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission."]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://dspace.mit.edu/handle/1721.1/7582"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/1721.1/55113"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, February 2009.","Cataloged from PDF version of thesis.","Includes bibliographical references (p. 41)."]},{"key":"dc:description.abstract","label":"Abstract","values":["This thesis proposes a games evaluation model that reports significant statistics about the complexity of a game's various systems. Quantitative complexity measurements allow designers to make accurate decisions about how to manage challenge, keeping in mind the player's physical and mental resources and the amount/type of actions the game requires players to act upon. Managing the operational challenge is critical to keeping players in a state of enjoyment, the primary purpose of video games. This thesis first investigates the relationship between enjoyment and complexity through the concept of Flow. From there it examines the properties of GOMS that are useful to analyzing videogames using Tetris as a case study, and then it examines and dissects the shortcomings of a direct usability approach and offers solutions based on a strategy game example. A third case study of the idle worker scenario in strategy games is detailed to further corroborate the usefulness of applying a GOMS based analysis to videogames. Using quantitative measurements of complexity, future research can aggressively tackle difficulty and challenge precisely, mitigate complexity to widen market appeal, and even reveal new genre possibilities."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["M.Eng."]},{"key":"dc:title","label":"Title","values":["Applying quantitative models to evaluate complexity in video game systems"]}]}],"canonical_facts":{"dc:contributor.advisor":["Robert C. Miller."],"dc:contributor.department":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."],"dc:contributor.other":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."],"dc:creator":["Tanwanteng, Matthew (Matthew E.)"],"dc:date.accessioned":["2010-05-25T20:43:53Z"],"dc:date.available":["2010-05-25T20:43:53Z"],"dc:date.issued":["2009"],"dc:description":["Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, February 2009.","Cataloged from PDF version of thesis.","Includes bibliographical references (p. 41)."],"dc:description.abstract":["This thesis proposes a games evaluation model that reports significant statistics about the complexity of a game's various systems. Quantitative complexity measurements allow designers to make accurate decisions about how to manage challenge, keeping in mind the player's physical and mental resources and the amount/type of actions the game requires players to act upon. Managing the operational challenge is critical to keeping players in a state of enjoyment, the primary purpose of video games. This thesis first investigates the relationship between enjoyment and complexity through the concept of Flow. From there it examines the properties of GOMS that are useful to analyzing videogames using Tetris as a case study, and then it examines and dissects the shortcomings of a direct usability approach and offers solutions based on a strategy game example. A third case study of the idle worker scenario in strategy games is detailed to further corroborate the usefulness of applying a GOMS based analysis to videogames. Using quantitative measurements of complexity, future research can aggressively tackle difficulty and challenge precisely, mitigate complexity to widen market appeal, and even reveal new genre possibilities."],"dc:description.degree":["M.Eng."],"dc:identifier.uri":["http://hdl.handle.net/1721.1/55113"],"dc:language.iso":["eng"],"dc:publisher":["Massachusetts Institute of Technology"],"dc:rights":["M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission."],"dc:rights.uri":["http://dspace.mit.edu/handle/1721.1/7582"],"dc:subject":["Electrical Engineering and Computer Science."],"dc:title":["Applying quantitative models to evaluate complexity in video game systems"],"dc:type":["Thesis"]},"updated_at":"2026-07-22T22:21:34Z"}