{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:56:42Z","timestamp":1760597802965,"version":"build-2065373602"},"reference-count":13,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2018,11,1]],"date-time":"2018-11-01T00:00:00Z","timestamp":1541030400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2018,11,1]],"date-time":"2018-11-01T00:00:00Z","timestamp":1541030400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2022,11,14]],"date-time":"2022-11-14T00:00:00Z","timestamp":1668384000000},"content-version":"vor","delay-in-days":1474,"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2018,11,1]],"date-time":"2018-11-01T00:00:00Z","timestamp":1541030400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2018,11,1]],"date-time":"2018-11-01T00:00:00Z","timestamp":1541030400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2018,11,1]],"date-time":"2018-11-01T00:00:00Z","timestamp":1541030400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2018,11,1]],"date-time":"2018-11-01T00:00:00Z","timestamp":1541030400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2018,11,1]],"date-time":"2018-11-01T00:00:00Z","timestamp":1541030400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-004"}],"funder":[{"name":"JST CREST","award":["JPMJCR1402"],"award-info":[{"award-number":["JPMJCR1402"]}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1016\/j.tcs.2018.03.018","type":"journal-article","created":{"date-parts":[[2018,3,22]],"date-time":"2018-03-22T17:29:18Z","timestamp":1521739758000},"page":"17-27","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["Threes!, Fives, 1024!, and 2048 are hard"],"prefix":"10.1016","volume":"748","author":[{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0001-6999-3088","authenticated-orcid":false,"given":"Stefan","family":"Langerman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yushi","family":"Uno","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2018.03.018_br0010","series-title":"8th International Conference on Fun with Algorithms","first-page":"1:1","article-title":"2048 without new tiles is still hard","volume":"vol. 49","author":"Abdelkader","year":"2016"},{"issue":"1\u20132","key":"10.1016\/j.tcs.2018.03.018_br0020","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1142\/S0218195904001354","article-title":"Tetris is hard, even to approximate","volume":"14","author":"Breukelaar","year":"2004","journal-title":"Internat. J. Comput. Geom. Appl."},{"author":"Chen","key":"10.1016\/j.tcs.2018.03.018_br0030"},{"author":"Cirulli","key":"10.1016\/j.tcs.2018.03.018_br0040"},{"key":"10.1016\/j.tcs.2018.03.018_br0050","series-title":"Games of No Chance 3","first-page":"3","article-title":"Playing games with algorithms: algorithmic combinatorial game theory","volume":"vol. 56","author":"Demaine","year":"2009"},{"year":"1999","series-title":"Parameterized Complexity","author":"Downey","key":"10.1016\/j.tcs.2018.03.018_br0060"},{"key":"10.1016\/j.tcs.2018.03.018_br0070","series-title":"8th International Conference on Fun with Algorithms","first-page":"22:1","article-title":"Threes! Fives, 1024! and 2048 are hard","volume":"vol. 49","author":"Langerman","year":"2016"},{"key":"10.1016\/j.tcs.2018.03.018_br0080","article-title":"2048 is (PSPACE) hard, but sometimes easy","author":"Mehta","year":"2014","journal-title":"CoRR"},{"key":"10.1016\/j.tcs.2018.03.018_br0090","unstructured":"Phenomist, 2048 variants, https:\/\/2.zoppoz.workers.dev:443\/http\/phenomist.wordpress.com\/2048-variants\/, 2014."},{"key":"10.1016\/j.tcs.2018.03.018_br0100","unstructured":"QuadmasterXLII, Solve a deterministic version of 2048 using the fewest bytes, https:\/\/2.zoppoz.workers.dev:443\/http\/codegolf.stackexchange.com\/questions\/24885\/solve-a-deterministic-version-of-2048-using-the-fewest-bytes, 2014."},{"author":"Richardson","key":"10.1016\/j.tcs.2018.03.018_br0110"},{"key":"10.1016\/j.tcs.2018.03.018_br0120","unstructured":"Saming, 2048, https:\/\/2.zoppoz.workers.dev:443\/http\/saming.fr\/p\/2048\/, March 2014."},{"author":"Vollmer","key":"10.1016\/j.tcs.2018.03.018_br0130"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0304397518301798?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0304397518301798?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T00:57:11Z","timestamp":1759625831000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397518301798"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11]]},"references-count":13,"alternative-id":["S0304397518301798"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.tcs.2018.03.018","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2018,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Threes!, Fives, 1024!, and 2048 are hard","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.tcs.2018.03.018","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2018 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}