Results 11 to 20 of about 279 (214)

On a combinatorial game

open access: yesJournal 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

The Game Is Not over Yet—Go in the Post-AlphaGo Era

open access: yesPhilosophies, 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

A uniform realization of the combinatorial $R$-matrix [PDF]

open access: yesDiscrete 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

Notes on the combinatorial game: graph Nim

open access: yesElectronic 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   +1 more source

Just playing, but seriously

open access: yesFestival dell'Architettura Magazine, 2020
Play and the game, the central themes of this issue of FAMagazine, bring together various fields of artistic knowledge to become a key to understanding their use in recomposing the multidimensional nature of knowledge and the world itself, able to oppose
Tommaso Brighenti
doaj   +1 more source

A Cop and Drunken Robber Game on n-Dimensional Infinite-Grid Graphs

open access: yesMathematics, 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

Combinatorial Aspects of Flashcard Games [PDF]

open access: yesAnnals of Combinatorics, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lewis, Joel Brewster, Li, Nan
openaire   +4 more sources

Combinatorial Aspects of the Card Game War [PDF]

open access: yesAustralas. J Comb., 2022
This paper studies a single-suit version of the card game War on a finite deck of cards. There are varying methods of how players put the cards that they win back into their hands, but we primarily consider randomly putting the cards back and deterministically always putting the winning card before the losing card.
Tanya Khovanova, Atharva Pathak
openaire   +3 more sources

Decision Making in Team-Adversary Games with Combinatorial Action Space

open access: yesCAAI 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

On the Learnability of Programming Language Semantics [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2017
Game semantics is a powerful method of semantic analysis for programming languages. It gives mathematically accurate models ("fully abstract") for a wide variety of programming languages.
Dan R. Ghica, Khulood Alyahya
doaj   +1 more source

Home - About - Disclaimer - Privacy