The complexity of UNO

Details The complexity of UNO The complexity of UNO

2010-03-15

arxiv.org/abs/1003.2851v1

Computer Science

Discrete Mathematics

12 body pages, 2 appendix pages, 8 figures

Scientific paper

UNO is one of the world-wide well-known and popular card games. We investigate UNO from the viewpoint of combinatorial algorithmic game theory by giving some simple and concise mathematical models for it. They include cooperative and uncooperative versions of UNO, for example. As a result of analyzing their computational complexities, we prove that even a single-player version 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-complete.

Affiliated with

Also associated with

No associations

Rating

The complexity of UNO does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The complexity of UNO, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The complexity of UNO will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-214096