Results 21 to 30 of about 1,181,281 (295)
Combinatorial Game and Number Triangle [PDF]
, 2023 By considering a triangular array of numbers for first six rows, we introduce a combinatorial game, whose solution depends on a number triangle. The conclusion brings us with a surprising consequence in deciding the result of the game.
Ramaswamy Sivaraman +3 more
core +1 more source
A Class of Fibonacci Matrices, Graphs, and Games
Mathematics, 2022 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]
Informatică economică, 2014 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
A uniform realization of the combinatorial $R$-matrix [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 Kirillov-Reshetikhin (KR) crystals are colored directed graphs encoding the structure of certain finite-dimensional representations of affine Lie algebras.
Cristian Lenart, Arthur Lubovsky
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 +3 more sources
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
A Cop and Drunken Robber Game on n-Dimensional Infinite-Grid Graphs
Mathematics, 2021 A Cop and Drunken Robber (CDR) game is one variation of a famous combinatorial game, called Cops and Robbers, which has been extensively studied and applied in the area of theoretical and computer science as demonstrated by several conferences and ...
Nuttanon Songsuwan +3 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
The Game Is Not over Yet—Go in the Post-AlphaGo Era
Philosophies, 2020 The game of Go was the last great challenge for artificial intelligence in abstract board games. AlphaGo was the first system to reach supremacy, and subsequent implementations further improved the state of the art.
Attila Egri-Nagy, Antti Törmänen
doaj +1 more source
Combinatorial Aspects of Flashcard Games [PDF]
Annals of Combinatorics, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lewis, Joel Brewster, Li, Nan
openaire +4 more sources