3 citations · 3 across the 3 of their papers we have counts for
3 papers
cs.CC2015★ 3 cited
Threes!, Fives, 1024!, and 2048 are Hard
Stefan Langerman, Yushi Uno
We analyze the computational complexity of the popular computer games Threes!, 1024!, 2048 and many of their variants. For most known versions expanded to an m x n board, we show t…
cs.DM2012
On Complexity of Flooding Games on Graphs with Interval Representations
Hiroyuki Fukui, Yota Otachi, Ryuhei Uehara +2
The flooding games, which are called Flood-It, Mad Virus, or HoneyBee, are a kind of coloring games and they have been becoming popular online. In these games, each player colors o…
cs.DM2012
Solving Tantrix via Integer Programming
Fumika Kino, Yushi Uno
Tantrix is a puzzle to make a loop by connecting lines drawn on hexagonal tiles, and the objective of this research is to solve it by a computer. For this purpose, we give a proble…