Dynamic single-pile Nim using multiple bases.
Evolving small-board Go players using coevolutionary temporal difference learning with archives
We apply Coevolutionary Temporal Difference Learning (CTDL) to learn small-board Go strategies represented as weighted piece counters. CTDL is a randomized learning technique which interweaves two search processes that operate in the intra-game and inter-game mode. Intra-game learning is driven by gradient-descent Temporal Difference Learning (TDL), a reinforcement learning method that updates the board evaluation function according to differences observed between its values for consecutively visited...
Further analysis on the “king and rook vs. king on a quarter-infinite board” problem.
Further hopping with toads and frogs.
Game chromatic number of Cartesian product graphs.
Geography played on an -cycle times a 4-cycle.
How to play MetaSquares
Identitäten bei den Stirling-Zahlen 2.Art aus kombinatorischen Überlegungen beim Würfelspiel.
King and rook vs. king on a quarter-infinite board.
Konane has infinite nim-dimension.
Min, a combinatorial game having a connection with prime numbers.
Minimal predictors in hat problems
We consider a combinatorial problem related to guessing the values of a function at various points based on its values at certain other points, often presented by way of a hat-problem metaphor: there are a number of players who will have colored hats placed on their heads, and they wish to guess the colors of their own hats. A visibility relation specifies who can see which hats. This paper focuses on the existence of minimal predictors: strategies guaranteeing at least one player guesses correctly,...
Multidimensional assignment: applications and some thoughts.
New results about impartial solitaire clobber
Impartial Solitaire Clobber is a one-player version of the combinatorial game Clobber, introduced by Albert et al. in 2002. The initial configuration of Impartial Solitaire Clobber is a graph, such that there is a stone placed on each of its vertex, each stone being black or white. A move of the game consists in picking a stone, and clobbering an adjacent stone of the opposite color. By clobbering we mean that the clobbered stone is removed from the graph, and replaced by the clobbering one....
New temperatures in Domineering.
Nim restrictions.
Nim with a modular Muller twist.
Nim-regularity of graphs.
On a Combinatorial game
On Nonadaptive Search Problem
2000 Mathematics Subject Classification: 91A46, 91A35.We consider nonadaptive search problem for an unknown element x from the set A = {1, 2, 3, . . . , 2^n}, n ≥ 3. For fixed integer S the questions are of the form: Does x belong to a subset B of A, where the sum of the elements of B is equal to S? We wish to find all integers S for which nonadaptive search with n questions finds x. We continue our investigation from [4] and solve the last remaining case n = 2^k , k ≥ 2.