Cookie Clicker

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.

1. https://github.com/kaixiao/Cookie-Clicker.

2. M must be large enough so that the effect of \(\frac{y_2}{y_1}\) not being an integer is irrelevant in the long run.

3. In the final analysis, we compare the time needed by the optimal algorithm starting from a worse state than the greedy one, so the greedy solution actually takes less time in Phase 2.

The authors would like to acknowledge the support of CREST, JST, Grant No. JPMJCR1402 and KAKENHI, JSPS, Grant No. 15K11985.

1. Mikhail Rudoy

   Present address: Google, Menlo Park, USA

Authors and Affiliations

1. CSAIL, Massachusetts Institute of Technology, Cambridge, USA

   Erik D. Demaine, Jayson Lynch, Mikhail Rudoy & Kai Xiao

2. University of Electro-Communications, Chofu, Japan

   Hiro Ito

3. F.R.S.-FNRS, Université Libre de Bruxelles, Brussels, Belgium

   Stefan Langerman

Corresponding author

Correspondence to Kai Xiao.

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

http://orteil.dashnet.org/cookieclicker/.

Reprints and permissions