Computational bounds for the 2048 game

03/09/2023
by   Alexey Slizkov, et al.
0

2048 is a single player video game, played by millions mostly on mobile devices. We prove rigorously for the first time that there is an algorithm with winning probability at least 0.99969, and that there is a strategy for achieving the 256 tile guaranteed (with probability 1).

READ FULL TEXT

page 2

page 7

page 8

page 12

research
11/21/2022

Celeste is PSPACE-hard

We investigate the complexity of the platform video game Celeste. We pro...
research
04/19/2018

Analysis of the Game "2048" and its Generalization in Higher Dimensions

We theoretically analyze the popular mobile app game `2048' for the firs...
research
05/15/2019

ELIMINATION from Design to Analysis

Elimination is a word puzzle game for browsers and mobile devices, where...
research
04/25/2021

The connection between the PQ penny flip game and the dihedral groups

This paper is inspired by the PQ penny flip game. It employs group-theor...
research
06/02/2019

Feature-Based Q-Learning for Two-Player Stochastic Games

Consider a two-player zero-sum stochastic game where the transition func...
research
05/09/2019

Jcave: A 3D Interactive Game to Assist Home Physiotherapy Rehabilitation

The purpose of this paper is to investigate the applicability of applyin...
research
04/05/2019

Achieving Optimal Backlog in Multi-Processor Cup Games

The single- and multi- processor cup games can be used to model natural ...

Please sign up or login with your details

Forgot password? Click here to reset