The Game of Cycles, invented by Francis Su (2020, p.51) is an impartial game played on a graph, where players take turns marking an edge according to a set of rules. Together with the game, there also came a conjecture that gives a condition for whether a specific position is winning or losing. Proving or disproving this conjecture is the main focus of this research, which we end up succeeding in by giving a counter-example, thus disproving the conjecture. We do this by first showcasing some relevant background knowledge from game theory in chapter 1. In chapter 2 we then introduce the Game of Cycles and its rules, as well as some of the previous results others have found. We continue in chapter 3 by creating a python script to brute-force ...
In a Maker-Breaker game on a graph G, Breaker and Maker alternately claim edges of G. Maker wins if,...
Nim is a well-known two-player impartial combinatorial game. Various versions of playing Nim on grap...
Two players A and C play the following game on a graph G. They orient the edges of G alternately wit...
This report details my adventures exploring the Game of Cycles in search of winning strategies. I st...
International audienceIn this paper, we study the recently introduced scoring game played on graphs ...
In this paper, we study the recently introduced scoring game played on graphs called the Edge-Balanc...
AbstractWe present results on a combinatorial game which was proposed to one of the authors by Ingo ...
AbstractLet Maker and Breaker alternately select respectively 1 and q previously unclaimed edges of ...
Two players claim alternately edges of the complete graph on n vertices. The winner is the one who m...
In a Maker-Breaker game on a graph G, Breaker and Maker alternately claim edges of G. Maker wins if,...
Positional games have been introduced by Hales and Jewett in 1963 and have been extensively investig...
In a Maker-Breaker game on a graph G, Breaker and Maker alternately claim edges of G. Maker wins if,...
The Game of Cycles is a combinatorial game introduced by Francis Su in 2020 in which players take tu...
Positional games have been introduced by Hales and Jewett in 1963 and have been extensively investig...
Positional games have been introduced by Hales and Jewett in 1963 and have been extensively investig...
In a Maker-Breaker game on a graph G, Breaker and Maker alternately claim edges of G. Maker wins if,...
Nim is a well-known two-player impartial combinatorial game. Various versions of playing Nim on grap...
Two players A and C play the following game on a graph G. They orient the edges of G alternately wit...
This report details my adventures exploring the Game of Cycles in search of winning strategies. I st...
International audienceIn this paper, we study the recently introduced scoring game played on graphs ...
In this paper, we study the recently introduced scoring game played on graphs called the Edge-Balanc...
AbstractWe present results on a combinatorial game which was proposed to one of the authors by Ingo ...
AbstractLet Maker and Breaker alternately select respectively 1 and q previously unclaimed edges of ...
Two players claim alternately edges of the complete graph on n vertices. The winner is the one who m...
In a Maker-Breaker game on a graph G, Breaker and Maker alternately claim edges of G. Maker wins if,...
Positional games have been introduced by Hales and Jewett in 1963 and have been extensively investig...
In a Maker-Breaker game on a graph G, Breaker and Maker alternately claim edges of G. Maker wins if,...
The Game of Cycles is a combinatorial game introduced by Francis Su in 2020 in which players take tu...
Positional games have been introduced by Hales and Jewett in 1963 and have been extensively investig...
Positional games have been introduced by Hales and Jewett in 1963 and have been extensively investig...
In a Maker-Breaker game on a graph G, Breaker and Maker alternately claim edges of G. Maker wins if,...
Nim is a well-known two-player impartial combinatorial game. Various versions of playing Nim on grap...
Two players A and C play the following game on a graph G. They orient the edges of G alternately wit...