Cookie clicker

DOI10.1007/S00373-019-02093-4MaRDI QIDQ2308498zbMATH OpenOpenAlexFDO

Authors Erik D. Demaine, Hiro Ito, Stefan Langerman, Jayson Lynch, Mikhail Rudoy, Kai Xiao

Publication date 3 April 2020

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1808.07540, https://dipot.ulb.ac.be/dspace/bitstream/2013/296790/3/1808.07540.pdf

zbMATH Keywords

cookie clickerdynamic programminggamesNP-hardness

Mathematics Subject Classification ID

Approximation algorithms (68W25) Dynamic programming (90C39) Other game-theoretic models (91A40) Algorithmic game theory and complexity (91A68)

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.

Recommendations

• On the cookie game
• scientific article; zbMATH DE number 2222002
• An automatic HTTP cookie management system

Cites work

• Algorithms – ESA 2005
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)

Cited in

(2)

• On the cookie game
• Achieving balance in the ARPG genre of video games with asymmetrical choices

This page was built for publication: Cookie clicker

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2308498)