no code implementations • 7 Mar 2016 • Jean-Francois Baffier, Man-Kwun Chiu, Yago Diez, Matias Korman, Valia Mitsou, André van Renssen, Marcel Roeloffzen, Yushi Uno
On the positive side, we show that the decision version of the problem---to decide whether or not numbers from $1$ through $n$ can be played for every color---can be solved in (almost) linear time for some restricted cases.
Discrete Mathematics Computational Complexity
no code implementations • 16 May 2015 • Stefan Langerman, Yushi Uno
We analyze the computational complexity of the popular computer games Threes!, 1024!, 2048 and many of their variants.
Computational Complexity Computer Science and Game Theory
no code implementations • 15 Mar 2010 • Erik D. Demaine, Martin L. Demaine, Nicholas J. A. Harvey, Ryuhei Uehara, Takeaki Uno, Yushi Uno
This paper investigates the popular card game UNO from the viewpoint of algorithmic combinatorial game theory.
Discrete Mathematics Computational Complexity G.2; F.1
