|
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/12881
|
| Title: | Game Refinement Theory and Multiplayer Games: Case Study Using UNO |
| Authors: | Ramadhan, Alfian
Iida, Hiroyuki
Maulidevi, Nur Ulfa |
| Keywords: | UNO card game
game refinement theory
multiplayer game
incomplete information game |
| Issue Date: | 2015-02-22 |
| Publisher: | IARIA |
| Magazine name: | eKNOW 2015 : The Seventh International Conference on Information, Process, and Knowledge Management |
| Start page: | 119 |
| End page: | 125 |
| Abstract: | Game refinement theory has started to provide some interesting tools to measure sophistication of board games, sport games, and video games. In this paper, we apply game refinement theory to UNO(R) card game, from which we identify valuable aspects regarding multiplayer and incomplete information game. Specifically, we analyze game refinement value zone of UNO and reveal recommended number of players to play. Furthermore, we compare the measure of enjoyment between the players. Experiments have been conducted by developing various computer player types and simulating about 1.4 million UNO games. Results show that critical states of the game and number of card played are the important factors and confirm that UNO is best to play with 4, 5, or 6 players. Furthermore, another result shows that the second last and the last player get the most enjoyment out of the game. |
| Rights: | Copyright (C) 2015 IARIA. Alfian Ramadhan, Hiroyuki Iida, Nur Ulfa Maulidevi, eKNOW 2015 : The Seventh International Conference on Information, Process, and Knowledge Management, 2015, 119-125. This material is posted here with permission of IARIA. |
| URI: | http://hdl.handle.net/10119/12881 |
| Material Type: | publisher |
| Appears in Collections: | b11-1. 会議発表論文・発表資料 (Conference Papers)
|
Files in This Item:
| File |
Description |
Size | Format |
|---|
| 21529.pdf | | 306Kb | Adobe PDF | View/Open |
|
All items in DSpace are protected by copyright, with all rights reserved.
|
