Results 1 to 10 of about 596,890 (279)
Solving Probabilistic Combinatorial Games [PDF]
, 2006 Probabilistic combinatorial games (PCGs) are a model for Go-like games recently introduced by Ken Chen. They differ from normal combinatorial games since terminal positions in each subgame are evaluated by a probability distribution. The distribution expresses the uncertainty in the local evaluation.
Ling Zhao, Martin Müller 0003
openaire +1 more source
Cubic Pisot unit combinatorial games [PDF]
Monatshefte für Mathematik, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Duchêne, Eric, Rigo, Michel
openaire +4 more sources
Beyond Value Iteration for Parity Games: Strategy Iteration with Universal Trees [PDF]
Logical Methods in Computer ScienceParity games have witnessed several new quasi-polynomial algorithms since the breakthrough result of Calude et al. (STOC 2017). The combinatorial object underlying these approaches is a universal tree, as identified by Czerwiński et al. (SODA 2019).
Zhuan Khye Koh, Georg Loho
doaj +1 more source
Combinatorial Game Complexity: An Introduction with Poset Games
Bull. EATCS, 2015 Poset games have been the object of mathematical study for over a century, but little has been written on the computational complexity of determining important properties of these games. In this introduction we develop the fundamentals of combinatorial game theory and focus for the most part on poset games, of which Nim is perhaps the best-known ...
Stephen A. Fenner, John D. Rogers
openaire +3 more sources
Combinatorial Games: selected Bibliography with a Succinct Gourmet Introduction
, 2012 Roughly speaking, the family of combinatorial games consists of two-player games with perfect information (no hidden information as in some card games), no chance moves (no dice) and outcome restricted to (lose, win), (tie, tie) and (draw, draw) for the ...
A. Fraenkel
semanticscholar +1 more source
This paper examines two classical combinatorial games, Nim and the Domino Game on Linear Strips, through the shared principles of parity, recursion, and binary structure. It begins by formalizing Nim, where each position’s outcome is determined by the Nim-sum (bitwise XOR) of heap sizes: positions with zero Nim-sum are losing, and optimal play involves
Elliot Mendelson, Daniel Zwillinger
openaire +3 more sources
Em Teia, 2016 O texto apresenta experiências de professoras com práticas de letramento matemático escolar envolvendo acaso, chance, possibilidades, combinatória e análise de dados.
Regina Célia Grando
doaj +1 more source
Combinatorial optimization in nash games
Computers & Mathematics with Applications, 1993 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Combinatorial games modeling seki in GO
Discrete Mathematics, 2014 This paper describes results and conjectures on two closely related games, SEKI and D-SEKI, played on matrices of non-negative integers. These games were inspired of so-called seki positions in the game Go. This paper should be viewed as an investigation into the structure of SEKI and D-SEKI, without particular practical applications to Go.
Andrey Gol'berg +4 more
openaire +1 more source
PSPACE-hardness of some combinatorial games
Journal of Combinatorial Theory, Series A, 1987 PSPACE-hardness of four families of win-lose-draw games played on a digraph with blocking, capture, or annihilation rules is proved. Special cases of three of the families are shown to be PSPACE-complete. Further, the PSPACE-completeness of six families of win-lose games in which two players mark or remove nodes of digraphs according to given rules is ...
Aviezri S. Fraenkel +1 more
openaire +1 more source