Cookie Clicker

Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2018.

Bibliographic Details
Main Author: Xiao, Kai Yuanqing
Other Authors: Erik D. Demaine.
Format: Thesis
Language:eng
Published: Massachusetts Institute of Technology 2018
Subjects:
Online Access:http://hdl.handle.net/1721.1/119555
_version_ 1826214400526123008
author Xiao, Kai Yuanqing
author2 Erik D. Demaine.
author_facet Erik D. Demaine.
Xiao, Kai Yuanqing
author_sort Xiao, Kai Yuanqing
collection MIT
description Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2018.
first_indexed 2024-09-23T16:04:50Z
format Thesis
id mit-1721.1/119555
institution Massachusetts Institute of Technology
language eng
last_indexed 2024-09-23T16:04:50Z
publishDate 2018
publisher Massachusetts Institute of Technology
record_format dspace
spelling mit-1721.1/1195552019-04-10T11:16:19Z Cookie Clicker Xiao, Kai Yuanqing Erik D. Demaine. Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science. Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science. Electrical Engineering and Computer Science. Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2018. This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections. Cataloged from student-submitted PDF version of thesis. Includes bibliographical references (page 55). 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 NPhardness, approximation algorithms, and dynamic programming. by Kai Yuanqing Xiao. M. Eng. 2018-12-11T20:39:57Z 2018-12-11T20:39:57Z 2018 2018 Thesis http://hdl.handle.net/1721.1/119555 1076274075 eng MIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written permission. http://dspace.mit.edu/handle/1721.1/7582 55 pages application/pdf Massachusetts Institute of Technology
spellingShingle Electrical Engineering and Computer Science.
Xiao, Kai Yuanqing
Cookie Clicker
title Cookie Clicker
title_full Cookie Clicker
title_fullStr Cookie Clicker
title_full_unstemmed Cookie Clicker
title_short Cookie Clicker
title_sort cookie clicker
topic Electrical Engineering and Computer Science.
url http://hdl.handle.net/1721.1/119555
work_keys_str_mv AT xiaokaiyuanqing cookieclicker