| dc.contributor.author | Demaine, Erik D | |
| dc.contributor.author | Ito, Hiro | |
| dc.contributor.author | Langerman, Stefan | |
| dc.contributor.author | Lynch, Jayson | |
| dc.contributor.author | Rudoy, Mikhail | |
| dc.contributor.author | Xiao, Kai | |
| dc.date.accessioned | 2021-09-20T17:17:02Z | |
| dc.date.available | 2021-09-20T17:17:02Z | |
| dc.date.issued | 2019-09-10 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/131427 | |
| dc.description.abstract | Abstract
Cookie Clicker is a popular online incremental game where the goal of the game is to generate as many cookies as possible. In the game you start with an initial cookie generation rate, and you can use cookies as currency to purchase various items that increase your cookie generation rate. In this paper, we analyze strategies for playing Cookie Clicker optimally. While simple to state, the game gives rise to interesting analysis involving ideas from NP-hardness, approximation algorithms, and dynamic programming. | en_US |
| dc.publisher | Springer Japan | en_US |
| dc.relation.isversionof | https://doi.org/10.1007/s00373-019-02093-4 | en_US |
| dc.rights | Creative Commons Attribution-Noncommercial-Share Alike | en_US |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/4.0/ | en_US |
| dc.source | Springer Japan | en_US |
| dc.title | Cookie Clicker | en_US |
| dc.type | Article | en_US |
| dc.contributor.department | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory | |
| dc.eprint.version | Author's final manuscript | en_US |
| dc.type.uri | http://purl.org/eprint/type/JournalArticle | en_US |
| eprint.status | http://purl.org/eprint/status/PeerReviewed | en_US |
| dc.date.updated | 2020-09-24T20:43:52Z | |
| dc.language.rfc3066 | en | |
| dc.rights.holder | Springer Japan KK, part of Springer Nature | |
| dspace.embargo.terms | Y | |
| dspace.date.submission | 2020-09-24T20:43:52Z | |
| mit.license | PUBLISHER_CC | |
| mit.metadata.status | Authority Work and Publication Information Needed | |
