Please use this identifier to cite or link to this item:
https://www.um.edu.mt/library/oar/handle/123456789/82108| Title: | Game complexity vs strategic depth |
| Authors: | Stephenson, Matthew Perez-Liebana, Diego Nelson, Mark Khalifa, Ahmed Zook, Alexander |
| Keywords: | Computer games -- Design Artificial intelligence Machine learning |
| Issue Date: | 2019 |
| Publisher: | National Institute of Informatics, Japan |
| Citation: | Stephenson, M., Perez-Liebana, D., Nelson, M., Khalifa, A., & Zook, A. (2019). Game complexity vs strategic depth. NII Shonan Meeting 130, Shonan. |
| Abstract: | The notion of complexity and strategic depth within games has been a long- debated topic with many unanswered questions. How exactly do you measure the complexity of a game? How do you quantify its strategic depth objectively? This seminar answered neither of these questions but instead presents the opinion that these properties are, for the most part, subjective to the human or agent that is playing them. What is complex or deep for one player may be simple or shallow for another. Despite this, determining generally applicable measures for estimating the complexity and depth of a given game (either independently or comparatively), relative to the abilities of a given player or player type, can provide several bene ts for game designers and researchers. |
| URI: | https://www.um.edu.mt/library/oar/handle/123456789/82108 |
| Appears in Collections: | Scholarly Works - InsDG |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Game_Complexity_vs_Strategic_Depth_2019.pdf | 64.65 kB | Adobe PDF | View/Open |
Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.