Results 11 to 20 of about 1,181,281 (295)
Notes on the combinatorial game: graph Nim [PDF]
Electronic Journal of Graph Theory and Applications, 2016 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
Discrete Mathematics, 2023 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 ...
Richard Joseph Nowakowski, Urban Larsson
exaly +3 more sources
Universally Balanced Combinatorial Optimization Games [PDF]
Games, 2010 This article surveys studies on universally balanced properties of cooperative games defined in a succinct form. In particular, we focus on combinatorial optimization games in which the values to coalitions are defined through linear optimization programs, possibly combinatorial, that is subject to integer constraints. In economic settings, the integer
Xiaotie Deng
exaly +5 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]
Songklanakarin Journal of Science and Technology (SJST), 2021 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
, 1973 A combinatorial game played with dice is described as a piece of recreational mathematics and analysed by a dynamic programming approach.
Page ES
core +5 more sources
Snort: A combinatorial game [PDF]
, 2010 This paper focuses on the game Snort, which is a combinatorial game on graphs. This paper will explore the characteristics of opposability through examples. More fully, we obtain some neccessary conditions for a graph to be opposable.
Kakihara, Keiko
core +7 more sources
Toward Quantum Combinatorial Games [PDF]
Electronic Proceedings in Theoretical Computer Science, 2018 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
Synchronous Remote Learning with the Educational Game “StruniMa”
Педагогически форум, 2022 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
Vulnerability Evaluation of Port Logistics System Under Public Health Emergencies [PDF]
SHS Web of Conferences, 2023 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
Firing Patterns in the Parallel Chip-Firing Game [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 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