Results 1 to 10 of about 5,218 (313)
Notes on the combinatorial game: graph Nim [PDF]
The combinatorial game of Nim can be played on graphs. Over the years, various Nim-like games on graphs have been proposed and studied by N.J. Calkin et al., L.A. Erickson and M. Fukuyama.
Richard M. Low, W.H. Chan
doaj +2 more sources
Atomic weights and the combinatorial game of bipass
We define an all-small ruleset, Bipass, within the framework of normal-play combinatorial games. A game is played on finite strips of black and white stones. Stones of different colors are swapped provided they do not bypass one of their own kind. We find a surjective function from the strips to integer atomic weights (Berlekamp, Conway and Guy 1982 ...
Urban Larsson, Richard J Nowakowski
exaly +3 more sources
Greedy strategy for some normal m x n closing octagons games and winning strategy for normal 1 x n and 2 x n closing octagons games [PDF]
m x n Closing Octagons (CO) game is a combinatorial game for two players. The game starts with an m x n array of octagons such that every two adjacent octagons has one common side and 0 points. Players alternately turn by the following rules.
Ratinan Boonklurb +1 more
doaj +1 more source
Vulnerability Evaluation of Port Logistics System Under Public Health Emergencies [PDF]
It is the goal that evaluating scientifically port logistics system vulnerability level under public health emergencies, exploring the influencing factors of brittleness and improving the production operation and management efficiency of port logistics ...
Liu Cuilian, Jiang Hao, Qin Kun
doaj +1 more source
Toward Quantum Combinatorial Games [PDF]
In this paper, we propose a Quantum variation of combinatorial games, generalizing the Quantum Tic-Tac-Toe proposed by Allan Goff. A combinatorial game is a two-player game with no chance and no hidden information, such as Go or Chess.
Paul Dorbec, Mehdi Mhalla
doaj +1 more source
Firing Patterns in the Parallel Chip-Firing Game [PDF]
The $\textit{parallel chip-firing game}$ is an automaton on graphs in which vertices "fire'' chips to their neighbors. This simple model, analogous to sandpiles forming and collapsing, contains much emergent complexity and has connections to different ...
Ziv Scully, Tian-Yi Jiang, Yan Zhang
doaj +1 more source
A Class of Fibonacci Matrices, Graphs, and Games
In this paper, we define a class of Fibonacci graphs as graphs whose adjacency matrices are obtained by alternating binary Fibonacci words. We show that Fibonacci graphs are close in size to Turán graphs and that their size-stability tradeoff defined as ...
Valentin E. Brimkov, Reneta P. Barneva
doaj +1 more source
An Efficient Speedup Strategy for Constant Sum Game Computations [PDF]
Large classes of game theoretic problems seem to defy attempts of finding polynomial-time al-gorithms while analyzing large amounts of data. This premise leads naturally to the possibility of using efficient parallel computing implementations when ...
Alexandru-Ioan STAN
doaj +1 more source
Synchronous Remote Learning with the Educational Game “StruniMa”
StruniMa is an educational mathematical game and in particular – combinatorial geometry. “Shkola” (school) is a component with which synchronous remote learning is realized.
Mladen Valkov
doaj +1 more source
Arboreal Categories: An Axiomatic Theory of Resources [PDF]
Game comonads provide a categorical syntax-free approach to finite model theory, and their Eilenberg-Moore coalgebras typically encode important combinatorial parameters of structures.
Samson Abramsky, Luca Reggio
doaj +1 more source

