Related papers: How to Beat Capablanca
The game of Knockout is a classic playground game played with two basketballs. This paper uses a Markov process to analyze each player's probability of winning the game given their starting position in line and shooting percentages,…
A novel approach to learning is presented, combining features of on-line and off-line methods to achieve considerable performance in the task of learning a backgammon value function in a process that exploits the processing power of…
This paper is concerned with continuous-time pursuit and evasion games. Typically, we have a lion and a man in a metric space: they have the same speed, and the lion wishes to catch the man while the man tries to evade capture. We are…
We consider the Maker-Breaker positional game on the vertices of the $n$-dimensional hypercube $\{0,1\}^n$ with $k$-dimensional subcubes as winning sets. We describe a pairing strategy which allows Breaker to win if $n$ is a power of 4 and…
Learning to adapt and make real-time informed decisions in a dynamic and complex environment is a challenging problem. Monopoly is a popular strategic board game that requires players to make multiple decisions during the game.…
Maker-Breaker subgraph games are among the most famous combinatorial games. For given $n,q \in \mathbb{N}$ and a subgraph $C$ of the complete graph $K_n$, the two players, called Maker and Breaker, alternately claim edges of $K_n$. In each…
For two graphs $B$ and $H$ the strong Ramsey game $\mathcal{R}(B,H)$ on the board $B$ and with target $H$ is played as follows. Two players alternately claim edges of $B$. The first player to build a copy of $H$ wins. If none of the players…
Major advances in Question Answering technology were needed for IBM Watson to play Jeopardy! at championship level -- the show requires rapid-fire answers to challenging natural language questions, broad general knowledge, high precision,…
We investigate Maker-Breaker games on graphs of size $\aleph_1$ in which Maker's goal is to build a copy of the host graph. We establish a firm dependence of the outcome of the game on the axiomatic framework. Relating to this, we prove…
Let $\kappa$ be an infinite cardinal. Then, forcing with $\mathbb{R}(\kappa)$$\times$$\mathbb{R}(\kappa)$ adds a generic filter for $\mathbb{C}(\kappa);$ where $\mathbb{R}(\kappa)$ and $\mathbb{C}(\kappa)$ are the forcing notions for adding…
The $m \times n$ king graph consists of all locations on an $m \times n$ chessboard, where edges are legal moves of a chess king. %where each vertex represents a square on a chessboard and each edge is a legal move. Let $P_{m \times n}(z)$…
The main challenge of combinatorial game theory is to handle combinatorial chaos, if one player knows the strategy better than his opponent, he is able to determine the exact results of a game. If both players are qualified competitor, the…
The classical Maker-Breaker positional game is played on a board which is a hypergraph $\mathcal{H}$, with two players, Maker and Breaker, alternately claiming vertices of $\mathcal{H}$ until all the vertices are claimed. When the game…
In sports competitions, teams can manipulate the result by, for instance, throwing games. We show that we can decide how to manipulate round robin and cup competitions, two of the most popular types of sporting competitions in polynomial…
The McNaughton-Zielonka divide et impera algorithm is the simplest and most flexible approach available in the literature for determining the winner in a parity game. Despite its theoretical worst-case complexity and the negative reputation…
We answer a question posed in [Elkies 1996] (math.CO/9905198) by constructing a class of pawn endgames on m-by-n boards that show the Nimbers *k for large k. We do this by modifying and generalizing T.R. Dawson's ``pawns game'' [Berlekamp…
This paper studies a single-suit version of the card game War on a finite deck of cards. There are varying methods of how players put the cards that they win back into their hands, but we primarily consider randomly putting the cards back…
To count the number of maximum independent arrangements of $n^2$ kings on a $2n\times 2n$ chessboard, we build a $2^n \times (n+1)$ matrix whose entries are independent arrangements of $n$ kings on $2\times 2n$ rectangles. Utilizing upper…
We study a type of generalized recursive game introduced by Castronova, Chen, and Zumbrun featuring increasing stakes, with an emphasis on continuous guts poker and $1$ v. $n$ coalitions. Our main results are to develop practical numerical…
We consider a random knockout tournament among players $1, \ldots, n$, in which each match involves two players. The match format is specified by the number of matches played in each round, where the constitution of the matches in a round…