|
JAIST Repository >
School of Information Science >
Conference Papers >
Conference Papers >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/10119/12371
|
| Title: | Attractiveness of Real Time Strategy Games |
| Authors: | Xiong, Shuo
Iida, Hiroyuki |
| Keywords: | Game refinement theory
StarCraft II |
| Issue Date: | 2014-11 |
| Publisher: | Institute of Electrical and Electronics Engineers (IEEE) |
| Magazine name: | 2014 2nd International Conference on Systems and Informatics (ICSAI) |
| Start page: | 271 |
| End page: | 276 |
| DOI: | 10.1109/ICSAI.2014.7009298 |
| Abstract: | Game refinement idea is a unique theory that has been proposed based on the uncertainty of game outcome. A game refinement measure was derived from the game information progress model and has been applied in the domains such as board games and sports games. The present challenge is to apply the game refinement theory in the domain of RTS games. To do so, we use StarCraft II as a testbed and introduce a concept of strategy tree in order to construct a game tree of a RTS game. Then, game refinement values are calculated and compared with other type of games. It is found that StarCraft II has a zone value of game refinement. |
| Rights: | This is the author's version of the work. Copyright (C) 2014 IEEE. 2014 2nd International Conference on Systems and Informatics (ICSAI), 2014, 271-276. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. |
| URI: | http://hdl.handle.net/10119/12371 |
| Material Type: | author |
| Appears in Collections: | b11-1. 会議発表論文・発表資料 (Conference Papers)
|
Files in This Item:
| File |
Description |
Size | Format |
|---|
| 21330.pdf | | 6208Kb | Adobe PDF | View/Open |
|
All items in DSpace are protected by copyright, with all rights reserved.
|
