Related papers: Hex implies Y

The game of the Towers of Hanoi is generalized to binary trees. First, a straightforward solution of the game is discussed. Second, a shorter solution is presented, which is then shown to be optimal.

Classify simple games into sixteen "types" in terms of the four conventional axioms: monotonicity, properness, strongness, and nonweakness. Further classify them into sixty-four classes in terms of finiteness (existence of a finite carrier)…

We introduce a generalization of "Solo Chess", a single-player variant of the game that can be played on chess.com. The standard version of the game is played on a regular 8 x 8 chessboard by a single player, with only white pieces, using…

The Game of Cycles, introduced by Su (2020), is played on a simple connected planar graph together with its bounded cells, and players take turns marking edges with arrows according to a sink-source rule that gives the game a topological…

We generalize the notion of convexity and average-convexity to the notion of weighted average-convexity. We show several results on the relation between weighted average-convexity and cooperative games. First, we prove that if a game is…

The strong Ramsey game $R(\mathcal{B}, H)$ is a two-player game played on a graph $\mathcal{B}$, referred to as the board, with a target graph $H$. In this game, two players, $P_1$ and $P_2$, alternately claim unclaimed edges of…

If K is an odd-dimensional flag closed manifold, flag generalized homology sphere or a more general flag weak pseudomanifold with sufficiently many vertices, then the maximal number of edges in K is achieved by the balanced join of cycles.…

This paper studies correlations among independently administered hypothetical tests of a simple interactive type, and demonstrates that correlations arising in quantum information theoretic variants of these tests can exhibit a striking…

The Hodge conjecture is shown to be equivalent to a question about the homology of very ample divisors with ordinary double point singularities. The infinitesimal version of the result is also discussed.

DeepMind's recent spectacular success in using deep convolutional neural nets and machine learning to build superhuman level agents --- e.g. for Atari games via deep Q-learning and for the game of Go via Reinforcement Learning --- raises…

We present a new, easy, and elementary proof of Jensen's Theorem on the uniqueness of infinity harmonic functions. The idea is to pass to a finite difference equation by taking maximums and minimums over small balls.

The classical result of Landau on the existence of kings in finite tournaments (=finite directed complete graphs) is extended to continuous tournaments for which the set X of players is a compact Hausdorff space. The following partial…

We introduce a way to parameterize automata and games on finite graphs with natural numbers. The parameters are accessed essentially by allowing counting down from the parameter value to 0 and branching depending on whether 0 has been…

Triangular peg solitaire is a well-known one-person game or puzzle. When one peg captures many pegs consecutively, this is called a sweep. We investigate whether the game can end in a dramatic fashion, with one peg sweeping all remaining…

This recreational mathematics article shows that the game of Snakes and Ladders is intransitive: square 69 has a winning edge over 79, which in turn beats 73, which beats 69. Analysis of the game is a nice illustration of Markov chains,…

In 1953 Gale noticed that for every n-person game in extensive form with perfect information modeled by a rooted treesome special Nash equilibrium in pure strategies can be found by an algorithm of successive elimination of leaves, which is…

Hecke algebras are beautiful q-extensions of Coxeter groups. In this paper, we prove several results on their characters, with an emphasis on characters induced from trivial and sign representations of parabolic subalgebras. While most of…

We propose a proof of the downward L\"owenheim-Skolem that relies on strategies deriving from evaluation games instead of the Skolem normal forms. This proof is simpler, and easily understood by the students, although it requires, when…

We study biased {\em orientation games}, in which the board is the complete graph $K_n$, and Maker and Breaker take turns in directing previously undirected edges of $K_n$. At the end of the game, the obtained graph is a tournament. Maker…

We study the computational complexity of an important property of simple, regular and weighted games, which is decisiveness. We show that this concept can naturally be represented in the context of hypergraph theory, and that decisiveness…