JCT
2008
13 years 4 months ago
2008
This paper introduces a new strategy for playing the marking game on graphs. Using this strategy, we prove that if G is a planar graph, then the game colouring number of G, and he...
CORR
2007
Springer
13 years 4 months ago
2007
Springer
We consider the one-person game of peg solitaire on a triangular board of arbitrary size. The basic game begins from a full board with one peg missing and finishes with one peg a...
CORR
2007
Springer
13 years 4 months ago
2007
Springer
We prove that the single-player game clobber is solvable in linear time when played on a line or on a cycle. For this purpose, we show that this game is equivalent to an optimizat...
ITA
2008
13 years 4 months ago
2008
We propose a variation of Wythoff's game on three piles of tokens, in the sense that the losing positions can be derived from the Tribonacci word instead of the Fibonacci word...
CORR
2006
Springer
13 years 4 months ago
2006
Springer
We study two-player games of infinite duration that are played on finite or infinite game graphs. A winning strategy for such a game is positional if it only depends on the current...
CORR
2006
Springer
13 years 4 months ago
2006
Springer
The solitaire army is a one-person peg jumping game where a player attempts to advance an "army" of pegs as far as possible into empty territory. The game was introduced...
COMBINATORICS
2006
13 years 4 months ago
2006
In the game G0 two players alternate removing positive numbers of counters from a single pile and the winner is the player who removes the last counter. On the first move of the g...
EJC
2008
13 years 4 months ago
2008
The numbers game is a one-player game played on a finite simple graph with certain "amplitudes" assigned to its edges and with an initial assignment of real numbers to i...
ECCC
2008
13 years 4 months ago
2008
In a two player game, a referee asks two cooperating players (who are not allowed to communicate) questions sampled from some distribution and decides whether they win or not base...
DM
2008
13 years 4 months ago
2008
This paper discusses the game colouring number of partial k-trees and planar graphs. Let colg(PT k) and colg(P) denote the maximum game colouring number of partial k trees and the...