Playing games with algorithms: Algorithmic combinatorial game theory
From MaRDI portal
Recommendations
Cited in
(40)- On variants of vertex geography on undirected graphs
- On the transformation capability of feasible mechanisms for programmable matter
- Equilibrium paths in discounted supergames
- Ice sliding games
- Complexity, appeal and challenges of combinatorial games
- Pushing lines helps: efficient universal centralised transformations for programmable matter
- Wooden geometric puzzles: Design and hardness proofs
- Twenty years of progress of \(\mathrm{JCDCG}^3\)
- Towards an algorithmic guide to Spiral Galaxies
- On bichromatic triangle game
- Games on triangulations
- PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
- An algorithmic analysis of a combinatorial game
- scientific article; zbMATH DE number 5823948 (Why is no real title available?)
- Restricted Power - Computational Complexity Results for Strategic Defense Games
- scientific article; zbMATH DE number 5145315 (Why is no real title available?)
- Playing games with algorithms: algorithmic combinatorial game theory
- Playing Games with Approximation Algorithms
- Scaling, Renormalization, and Universality in Combinatorial Games: The Geometry of Chomp
- Algorithmic Game Theory: A Snapshot
- Strategies in competing subset selection
- Impartial coloring games
- UNO is hard, even for a single player
- scientific article; zbMATH DE number 16390 (Why is no real title available?)
- Phutball is PSPACE-hard
- Algorithms, games, and the internet (extended abstract)
- Layered Battleship Game Changer Password System
- Playing Savitch and cooking games
- A global approach for solving edge-matching puzzles
- Hanabi is NP-hard, even for cheaters who look at their cards
- On the computational complexity of bridgecard
- The complexity of node blocking for dags
- scientific article; zbMATH DE number 7779759 (Why is no real title available?)
- Pushing lines helps: efficient universal centralised transformations for programmable matter
- Topological network-control games
- All paths lead to Rome
- Winning strategies: the emergence of base 2 in the game of nim
- Topological network-control games played on graphs
- Network control games played on graphs
- Zen puzzle garden is NP-complete
This page was built for publication: Playing games with algorithms: Algorithmic combinatorial game theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4779132)
