English
Related papers

Related papers: Cookie Clicker

200 papers

Deterministic walk in an excited random environment is a non-Markov integer-valued process $(X_n)_{n=0}^{\infty}$, whose jump at time $n$ depends on the number of visits to the site $X_n$. The environment can be understood as stacks of…

Probability · Mathematics 2014-10-21 Ivan Matic , David Sivakoff

Engaging students with well-designed clicker questions is one of the commonly used research-based instructional strategy in physics courses partly because it has a relatively low barrier to implementation [1]. Moreover, validated robust…

Physics Education · Physics 2020-06-15 Paul Justice , Emily Marshman , Chandralekha Singh

A checkers-like model game with a simplified set of rules is studied through extensive simulations of agents with different expertise and strategies. The introduction of complementary strategies, in a quite general way, provides a tool to…

Artificial Intelligence · Computer Science 2016-08-26 J. Quetzalcóatl Toledo-Marín , Rogelio Díaz-Méndez , Marcelo del Castillo Mussot

In the Maker-Breaker resolving game, two players named Resolver and Spoiler alternately select unplayed vertices of a given graph $G$. The aim of Resolver is to select all the vertices of some resolving set of $G$, while Spoiler aims to…

Combinatorics · Mathematics 2025-12-02 Savitha K S , Sandi Klavžar , Tijo James

In this paper we introduce novel algorithmic strategies for effciently playing two-player games in which the players have different or identical player roles. In the case of identical roles, the players compete for the same objective (that…

Computer Science and Game Theory · Computer Science 2013-03-26 Mugurel Ionut Andreica , Nicolae Tapus

In a Maker-Breaker game on a graph $G$, Breaker and Maker alternately claim edges of $G$. Maker wins if, after all edges have been claimed, the graph induced by his edges has some desired property. We consider four Maker-Breaker games…

Combinatorics · Mathematics 2013-09-24 Andrew Beveridge , Andrzej Dudek , Alan Frieze , Tobias Muller , Milos Stojakovic

ConnectX is a two-player game that generalizes the popular game Connect 4. The objective is to get X coins across a row, column, or diagonal of an M x N board. The first player to do so wins the game. The parameters (M, N, X) are allowed to…

Artificial Intelligence · Computer Science 2022-10-18 Sheel Shah , Shubham Gupta

In this paper, we develop a recommender system for a game that suggests potential items to players based on their interactive behaviors to maximize revenue for the game provider. Our approach is built on a reinforcement learning-based…

Artificial Intelligence · Computer Science 2021-11-18 Hung Nguyen , Minh Nguyen , Long Pham , Jennifer Adorno Nieves

The increased use of digital devices and applications has led to a rise in phishing attacks. We develop a serious game to raise awareness about phishing attacks and help people avoid these threats in a risk-free learning environment. This…

Cryptography and Security · Computer Science 2025-01-22 Argianto Rahartomo , Ahmed Tareq Ali Ghaleb , Mohammad Ghafari

Candy Nim is a variant of Nim in which both players aim to take the last candy in a game of Nim, with the added simultaneous secondary goal of taking as many candies as possible. We give bounds on the number of candies the first and second…

Combinatorics · Mathematics 2018-05-21 Nitya Mani , Rajiv Nelakanti , Simon Rubinstein-Salzedo , Alex Tholen

Security questions are one of the techniques used in fall-back authentication to retrieve forgotten passwords. This paper proposes a game design which aims to improve usability of system-generated security questions. In our game design, we…

Cryptography and Security · Computer Science 2017-07-26 Nicholas Micallef , Nalin Asanka Gamagedara Arachchilage

Given a set of integers $S = \{k_1,\ k_2,...,\ k_n\}$, the Cookie Monster Problem is the problem of making all elements of the set equal 0 in the minimum number of moves. Consider the analogy of cookie jars with distinct numbers of cookies,…

Combinatorics · Mathematics 2013-04-30 Megan Belzner

Tic Tac Toe is amongst the most well-known games. It has already been shown that it is a biased game, giving more chances to win for the first player leaving only a draw or a loss as possibilities for the opponent, assuming both the players…

Artificial Intelligence · Computer Science 2023-03-15 Bhavuk Kalra

Fallback authentication is used to retrieve forgotten passwords. Security questions are one of the main techniques used to conduct fallback authentication. In this paper, we propose a serious game design that uses system-generated security…

Cryptography and Security · Computer Science 2017-09-27 Nicholas Micallef , Nalin Asanka Gamagedara Arachchilage

Everyone learns to code nowadays. Writing code, however, does not go without testing, which unfortunately rarely seems to be taught explicitly. Testing is often not deemed important enough or is just not perceived as sufficiently exciting.…

Software Engineering · Computer Science 2024-04-16 Philipp Straubinger , Lena Bloch , Gordon Fraser

Data sharing issues pervade online social and economic environments. To foster social progress, it is important to develop models of the interaction between data producers and consumers that can promote the rise of cooperation between the…

Computer Science and Game Theory · Computer Science 2021-01-27 Víctor Gallego , Roi Naveiro , David Ríos Insua , Wolfram Rozas

Coin flipping is a cryptographic primitive in which two distrustful parties wish to generate a random bit in order to choose between two alternatives. This task is impossible to realize when it relies solely on the asynchronous exchange of…

Websites have an inherent interest in steering user navigation in order to, for example, increase sales of specific products or categories, or to guide users towards specific information. In general, website administrators can use the…

Social and Information Networks · Computer Science 2016-03-22 Florian Geigl , Kristina Lerman , Simon Walk , Markus Strohmaier , Denis Helic

Counter reachability games are played by two players on a graph with labelled edges. Each move consists in picking an edge from the current location and adding its label to a counter vector. The objective is to reach a given counter value…

Computer Science and Game Theory · Computer Science 2013-07-22 Julien Reichert

Graph pebbling is a game played on a connected graph G. A player purchases pebbles at a dollar a piece, and hands them to an adversary who distributes them among the vertices of G (called a configuration) and chooses a target vertex r. The…

Combinatorics · Mathematics 2008-11-21 D. Curtis , T. Hines , G. Hurlbert , T. Moyer