Search Results

The game of infinite Hex, proceeding from an arbitrary position, is a good example with all the features you seek. The game was the subject of my Oxford student Davide Leonessi's masters MFoCS dissert …

Consider the game of infinite Hex, where two players Red and Blue alternately place their stones on the infinite hex grid, each aiming to create a winning configuration. Red wins after infinite play, …

The answer to the topological version of Banach-Mazur games is negative, proved by Gabriel Debs in 1985: Debs, Gabriel, Stratégies gagnantes dans certains jeux topologiques (Winning strategies in cer …

For a partial answer, let me prove that every strategically closed partial order admits a nearly tactical winning strategy, one that depends only on the previous two moves, that is, on the previous mo …

Consider the Sudoku Solver-Spoiler game, a natural variation of the Sudoku game recently appearing in the question Who wins two-player Sudoku? posted by user PyRulez. In that game, the players attempt …

I have a question about the Chocolatier's game, which I had introduced in my recent answer to a question of Richard Stanley. To recap the game quickly, the Chocolatier offers up at each stage a finite …

I don't know about the game attributed to Specker, but here is a simple game with your desired features. Let us call it the Chocolatier's game. There are two players, the Chocolatier and the Glutton. …

Thanks for your kind words about my blog. In the general-size square Sudoku board, you have an $\kappa\times\kappa$ array of $\kappa\times\kappa$ local blocks for some (possibly infinite) cardinal $\ …

This is a really great question! Previous attempts to make sense of infinite Go have sometimes had problems because it wasn't clear how to define the winner of a game of Go after transfinite play. T …

Consider the arithmetic progression game, a two-player game of perfect information, in which the players take turns playing natural numbers, or finite sets of natural numbers, all distinct, and the fi …

I claim that Player A has a winning strategy in your game, and furthermore, it is a winning strategy for her simply to play the smallest available number. Let me consider the game along with several …

Consider the following open knight's tour on a $5\times 5$ board, starting at position $1$ and then touring the $5\times 5$ board in the indicated move order. The final position is $25$, from which th …

It is a very nice question. I claim that it is not sufficient that $C$ is determined, and indeed, there are counterexamples where $C$ is a game with only two moves. Consider the two-dimensional gam …

In ZFC, the player aiming for the empty set has a winning strategy in the game played on any infinite set, including the reals. Using the axiom of choice, we can well-order the set and thereby pretend …

This amounts to the Gale-Stewart theorem showing that open games are determined. The issue of draws can be easily finessed, as I explain below. Specifically, a game of perfect information is open for …