Digraph placement games
From MaRDI portal
Cites work
- \(11\times 11\) Domineering is solved: the first player wins
- A nontrivial surjective map onto the short Conway group
- A note on polynomial profiles of placement games
- Advances in finding ideal play on poset games
- Amazons, Konane, and cross purposes are PSPACE-complete
- Blockbusting and domineering
- Bounding game temperature using confusion intervals
- Combinatorial game theory
- Compound Node-Kayles on paths
- Counting domineering positions
- Counting the number of games
- Deciding the Winner of an Arbitrary Finite Poset Game Is PSPACE-Complete
- Game values and computational complexity: an analysis via black-white combinatorial games
- Games and Complexes II: Weight Games and Kruskal-Katona Type Bounds
- Games and complexes. I: Transformation via ideals
- scientific article; zbMATH DE number 3761989 (Why is no real title available?)
- scientific article; zbMATH DE number 3521877 (Why is no real title available?)
- scientific article; zbMATH DE number 1879188 (Why is no real title available?)
- Kayles and Nimbers
- Lessons in play. An introduction to combinatorial game theory
- Nim, a game with a complete mathematical theory.
- On the complexity of computing winning strategies for finite poset games
- On the complexity of some two-person perfect-information games
- Polynomial time graph families for Arc Kayles
- Solving \(8\times 8\) Domineering
- The complexity of poset games
This page was built for publication: Digraph placement games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7397027)
