Results 1 to 10 of about 38,156 (100)
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 +7 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 ...
Xiaotie Deng, Gabrielle Demange
doaj +4 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
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
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
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
Warm-starting quantum optimization [PDF]
Quantum, 2021 There is an increasing interest in quantum algorithms for problems of integer programming and combinatorial optimization. Classical solvers for such problems employ relaxations, which replace binary variables with continuous ones, for instance in the ...
Daniel J. Egger +2 more
doaj +1 more source
Two Pile Move-Size Dynamic Nim [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 The purpose of this paper is to solve a special class of combinational games consisting of two-pile counter pickup games for which the maximum number of counters that can be removed on each successive move changes during the play of the games.
Arthur Holshouser, Harold Reiter
doaj +1 more source
Fast strategies in biased Maker--Breaker games [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 We study the biased $(1:b)$ Maker--Breaker positional games, played on the edge set of the complete graph on $n$ vertices, $K_n$. Given Breaker's bias $b$, possibly depending on $n$, we determine the bounds for the minimal number of moves, depending on ...
Mirjana Mikalački, Miloš Stojaković
doaj +1 more source