Results 21 to 30 of about 596,890 (279)
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
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
CFR-MIX: Solving Imperfect Information Extensive-Form Games with Combinatorial Action Space [PDF]
International Joint Conference on Artificial Intelligence, 2021 In many real-world scenarios, a team of agents must coordinate with each other to compete against an opponent. The challenge of solving this type of game is that the team's joint action space grows exponentially with the number of agents, which results ...
Shuxin Li +4 more
semanticscholar +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
Journal of Combinatorial Theory, Series A, 1973 Es wird das folgende verallgemeinerte Mühlespiel betrachtet: Gegeben seien die Mengen \(A_k\) und es sei \(S= \bigcup ^m_{k=1}A_k\). Die beiden Spieler wählen abwechselnd je ein Element aus \(S\). Wer als erster alle Elemente einer der Mengen \(A_k\) zusammen hat, hat gewonnen. Sei \(|A_k| =n\) und sei \(m^*(n)\) die kleinste Zahl \(m\) (= Anzahl der \(
Paul Erdös, John L. Selfridge
openaire +2 more sources
Resolution Over Linear Equations: Combinatorial Games for Tree-like Size and Space [PDF]
ACM Transactions on Computation TheoryWe consider the proof system Res \((\oplus)\) introduced by Itsykson and Sokolov (Ann. Pure Appl. Log.’20), which is an extension of the resolution proof system and operates with disjunctions of linear equations over \({\mathbb {F}}_2\) .
S. Gryaznov, S. Ovcharov, Artur Riazanov
semanticscholar +1 more source