Name
Abstract | ||
|---|---|---|
UNO R is one of the world-wide well-known and popular card games. We investigate UNO from the viewpoint of combinatorial algorithmic game the- ory by giving some simple and concise mathematical models for it. They include cooperative and uncooperative versions of UNO, for example. As a result of an- alyzing their computational complexities, we prove that even a single-player ver- sion of UNO is NP-complete, while it becomes in P in some restricted cases. We also show that uncooperative two-player's version is PSPACE-comple te. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1007/978-3-642-13122-6_15 | Theor. Comput. Sci. |
Keywords | Field | DocType |
single-player version,uncooperative two-player,uncooperative version,combinatorial algorithmic game theory,computational complexity,concise mathematical model,popular card game,restricted case,single player | Computer science,Algorithmic game theory,Artificial intelligence,Mathematical model | Journal |
Volume | ISSN | ISBN |
521, | 0302-9743 | 3-642-13121-2 |
Citations | PageRank | References |
7 | 0.93 | 7 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Erik D. Demaine | 1 | 4624 | 388.59 |
| Martin L. Demaine | 2 | 592 | 84.37 |
| Ryuhei Uehara | 3 | 528 | 75.38 |
| Takeaki Uno | 4 | 1319 | 107.99 |
| yushi uno | 5 | 222 | 28.80 |