On using Monte-Carlo tree search to solve puzzles
MS Kiarostami, M Daneshvaramoli… - Proceedings of the …, 2021 - dl.acm.org
Solving puzzles has become increasingly important in artificial intelligence research since
the solutions could be directly applied to real-world or general problems such as …
the solutions could be directly applied to real-world or general problems such as …
2048 without new tiles is still hard
A Abdelkader, A Acharya, P Dasler - 8th international conference …, 2016 - drops.dagstuhl.de
We study the computational complexity of a variant of the popular 2048 game in which no
new tiles are generated after each move. As usual, instances are defined on rectangular …
new tiles are generated after each move. As usual, instances are defined on rectangular …
Analysis of the Game" 2048" and its Generalization in Higher Dimensions
M Das, G Paul - arXiv preprint arXiv:1804.07393, 2018 - arxiv.org
We theoretically analyze the popular mobile app game2048'for the first time in $ n $-
dimensional space. We show that one can reach the maximum value $2^{n_1n_2+ 1} $ and …
dimensional space. We show that one can reach the maximum value $2^{n_1n_2+ 1} $ and …