Hacker Newsnew | past | comments | ask | show | jobs | submitlogin
The complexity of UNO (2010) (arxiv.org)
34 points by indigodaddy on Nov 18, 2018 | hide | past | favorite | 5 comments


Our mathematical models make the following assumptions: (a) we do not take into account action cards nor the draw pile; (b) all the cards dealt to and in the hand of any player are open during the game (i.e., perfect-information);

Well, that's unfortunate, i.e. it's about UNO variants, not the actual game. UNO without action cards?!


Yeah, and that doesn't actually reflect the game-as-played. I have never played an Uno game with perfect information, or without action cards. I can't imagine it would even be fun! Also, try playing Hot Death Uno, which for me ups the strategy so it becomes a worthwhile game.


Thank you! That sounds nice and....extreme hehe. The names are so Cold War/1990ish.

http://www.oocities.org/hotdeathuno/html/printable.html


Published by Takeaki Uno and Yushi Uno, naturally. https://en.wikipedia.org/wiki/Aptronym


Reducing the non-cooperative version to a variant of GEOGRAPHY implicitly assumes perfect information -- basically that both people know each others' hands. I wonder what the complexity of optimal play is if you don't know your opponent's hand.




Consider applying for YC's Summer 2026 batch! Applications are open till May 4

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: