From 3b0ebc8eb1ebb8d8a44c94adcbbd6d208be706a0 Mon Sep 17 00:00:00 2001 From: Nemo Date: Mon, 28 Jun 2021 22:12:39 +0530 Subject: [PATCH] 2048 fixes --- README.md | 4 +- boardgame-research.rdf | 205 ++++++++++++++++++++++++++++++++++++++++- 2 files changed, 207 insertions(+), 2 deletions(-) diff --git a/README.md b/README.md index 6fa5206..4947fd5 100644 --- a/README.md +++ b/README.md @@ -62,7 +62,6 @@ If you aren't able to access any paper on this list, please [try using Sci-Hub]( # 2048 -- [Ensemble Determinization in Monte Carlo Tree Search for the Imperfect Information Card Game Magic: The Gathering](https://doi.org/10.1109%2Ftciaig.2012.2204883) (journalArticle) - [Systematic Selection of N-Tuple Networks for 2048](https://doi.org/10.1007%2F978-3-319-50935-8_8) (bookSection) - [Systematic selection of N-tuple networks with consideration of interinfluence for game 2048](https://doi.org/10.1109%2Ftaai.2016.7880154) (conferencePaper) - [An investigation into 2048 AI strategies](https://doi.org/10.1109%2Fcig.2014.6932920) (conferencePaper) @@ -71,6 +70,9 @@ If you aren't able to access any paper on this list, please [try using Sci-Hub]( - [Analysis of the Game "2048" and its Generalization in Higher Dimensions](http://arxiv.org/abs/1804.07393v2) (journalArticle) - [Multi-Stage Temporal Difference Learning for 2048-like Games](http://arxiv.org/abs/1606.07374v2) (journalArticle) - [2048 is (PSPACE) Hard, but Sometimes Easy](http://arxiv.org/abs/1408.6315v1) (journalArticle) +- [Temporal difference learning of N-tuple networks for the game 2048](http://ieeexplore.ieee.org/document/6932907/) (conferencePaper) +- [On the Complexity of Slide-and-Merge Games](http://arxiv.org/abs/1501.03837) (journalArticle) +- [2048 Without New Tiles Is Still Hard](http://drops.dagstuhl.de/opus/volltexte/2016/5885/) (journalArticle) # Accessibility - [Meeple Centred Design: A Heuristic Toolkit for Evaluating the Accessibility of Tabletop Games](http://link.springer.com/10.1007/s40869-018-0057-8) (journalArticle) diff --git a/boardgame-research.rdf b/boardgame-research.rdf index 6143c4c..1fbc335 100644 --- a/boardgame-research.rdf +++ b/boardgame-research.rdf @@ -6806,9 +6806,209 @@ DOI: 10.1007/978-3-030-04179-3_20 + + conferencePaper + + + ISBN 978-1-4799-3547-5 + 2014 IEEE Conference on Computational Intelligence and Games + DOI 10.1109/CIG.2014.6932907 + + + + + + + Dortmund, Germany + + + IEEE + + + + + + + Szubert + Marcin + + + + + Jaskowski + Wojciech + + + + + + Temporal difference learning of N-tuple networks for the game 2048 + 8/2014 + DOI.org (Crossref) + + + http://ieeexplore.ieee.org/document/6932907/ + + + 2021-06-28 16:09:20 + 1-8 + + + 2014 IEEE Conference on Computational Intelligence and Games (CIG) + + + + + attachment + Submitted Version + + + https://www.cs.put.poznan.pl/mszubert/pub/szubert2014cig.pdf + + + 2021-06-28 16:09:26 + 1 + application/pdf + + + journalArticle + + arXiv:1501.03837 [cs] + + + + + + Abdelkader + Ahmed + + + + + Acharya + Aditya + + + + + Dasler + Philip + + + + + + + + + Computer Science - Computational Complexity + + + + F.2.2 + + On the Complexity of Slide-and-Merge Games + We study the complexity of a particular class of board games, which we call `slide and merge' games. Namely, we consider 2048 and Threes, which are among the most popular games of their type. In both games, the player is required to slide all rows or columns of the board in one direction to create a high value tile by merging pairs of equal tiles into one with the sum of their values. This combines features from both block pushing and tile matching puzzles, like Push and Bejeweled, respectively. We define a number of natural decision problems on a suitable generalization of these games and prove NP-hardness for 2048 by reducing from 3SAT. Finally, we discuss the adaptation of our reduction to Threes and conjecture a similar result. + 2015-01-15 + arXiv.org + + + http://arxiv.org/abs/1501.03837 + + + 2021-06-28 16:09:34 + arXiv: 1501.03837 + + + attachment + arXiv Fulltext PDF + + + https://arxiv.org/pdf/1501.03837.pdf + + + 2021-06-28 16:09:48 + 1 + application/pdf + + + attachment + arXiv.org Snapshot + + + https://arxiv.org/abs/1501.03837 + + + 2021-06-28 16:09:52 + 1 + text/html + + + journalArticle + + + DOI 10.4230/LIPICS.FUN.2016.1 + + + + + + + Abdelkader + Ahmed + + + + + Acharya + Aditya + + + + + Dasler + Philip + + + + + + + + + Herbstritt + Marc + + + + + + + 000 Computer science, knowledge, general works + + + + + Computer Science + + + 2048 Without New Tiles Is Still Hard + 2016 + en + DOI.org (Datacite) + + + http://drops.dagstuhl.de/opus/volltexte/2016/5885/ + + + 2021-06-28 16:09:58 + Artwork Size: 14 pages +Medium: application/pdf +Publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany + 14 pages + 2048 - @@ -6817,6 +7017,9 @@ DOI: 10.1007/978-3-030-04179-3_20 + + + Accessibility