Results 11 to 20 of about 1,335 (259)
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 ...
Xiaotie Deng
exaly +6 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
A Novel Binary Hunger Games Search Algorithm with Data-Driven Repair for the Set Covering Problem [PDF]
BiomimeticsSolving problems associated with the efficient distribution and organization of resources has generated increasing interest in the scientific community. One of the most commonly used approaches consists of approximate solution techniques, which have been
Broderick Crawford +7 more
doaj +2 more sources
A method for eternally dominating strong grids [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 In the eternal domination game, an attacker attacks a vertex at each turn and a team of guards must move a guard to the attacked vertex to defend it. The guards may only move to adjacent vertices and no more than one guard may occupy a vertex.
Alizée Gagnon +7 more
doaj +1 more source
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
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
Decision Making in Team-Adversary Games with Combinatorial Action Space
CAAI Artificial Intelligence Research, 2023 The team-adversary game simulates many real-world scenarios in which a team of agents competes cooperatively against an adversary. However, decision-making in this type of game is a big challenge since the joint action space of the team is combinatorial ...
Shuxin Li +4 more
doaj +1 more source
An algorithmic analysis of Flood-It and Free-Flood-It on graph powers [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 Analysis of ...
Uéverton dos Santos Souza +2 more
doaj +1 more source
Arboreal Categories: An Axiomatic Theory of Resources [PDF]
Logical Methods in Computer Science, 2023 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
COMBINATORIAL GAMES IN MATH LEARNING – HOW TO STUDY THEM IN THE COMPULSORY SCHOOL [PDF]
Revista de Pedagogie, 2013 This paper proposes some mathematical games, simple and elegant, which can become activities that teachers can successfully use for the course “Game and movement“ or in any math class.
Luminita Catana
doaj +1 more source