Paper by Erik D. Demaine

Reference:

Erik D. Demaine, Hiro Ito, Stefan Langerman, Jayson Lynch, Mikhail Rudoy, and Kai Xiao, “Cookie Clicker”, Graphs and Combinatorics, volume 36, 2020, pages 269–302.

BibTeX

@Article{CookieClicker_GC,
  AUTHOR        = {Erik D. Demaine and Hiro Ito and Stefan Langerman and Jayson Lynch and Mikhail Rudoy and Kai Xiao},
  TITLE         = {Cookie Clicker},
  JOURNAL       = {Graphs and Combinatorics},
  journalurl    = {http://www.springer.com/mathematics/numbers/journal/373},
  VOLUME        = 36,
  YEAR          = 2020,
  PAGES         = {269--302},

  length        = {34 pages},
  withstudent   = 1,
  replaces      = {CookieClicker_JCDCGGG2017},
  papers        = {CookieClicker_JCDCGGG2017},
  doi           = {https://dx.doi.org/10.1007/s00373-019-02093-4},
  dblp          = {https://dblp.org/rec/journals/gc/DemaineILLRX20},
  comments      = {This paper is available as <A HREF="https://arxiv.org/abs/1808.07540">arXiv:1808.07540</A> and from <A HREF="https://doi.org/10.1007/s00373-019-02093-4">SpringerLink</A>.},
}

Abstract:

Cookie Clicker [http://orteil.dashnet.org/cookieclicker/] 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.

Comments:

This paper is available as arXiv:1808.07540 and from SpringerLink.

Length:

The paper is 34 pages.

Availability:

The paper is available in PDF (663k).

See information on file formats.

[Google Scholar search]

Related papers:

CookieClicker_JCDCGGG2017 (Cookie Clicker)