Complexity, appeal and challenges of combinatorial games
From MaRDI portal
Publication:1884999
DOI10.1016/j.tcs.2002.11.001zbMath1066.91017OpenAlexW2115003018MaRDI QIDQ1884999
Publication date: 27 October 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2002.11.001
Analysis of algorithms and problem complexity (68Q25) Enumerative combinatorics (05A99) Combinatorial games (91A46)
Related Items (19)
On variants of vertex geography on undirected graphs ⋮ The complexity of constraint satisfaction games and QCSP ⋮ The Complexity of Poset Games ⋮ A polynomial algorithm for a two parameter extension of Wythoff NIM based on the Perron-Frobenius theory ⋮ Vertex Nim played on graphs ⋮ Impartial coloring games ⋮ From heaps of matches to the limits of computability ⋮ The \(\star\)-operator and invariant subtraction games ⋮ Unnamed Item ⋮ From Combinatorial Games to Shape-Symmetric Morphisms ⋮ Games played by Boole and Galois ⋮ Extensions and restrictions of Wythoff's game preserving its \(\mathcal P\) positions ⋮ Combinatorial games modeling seki in Go ⋮ Nonlinear dynamics in combinatorial games: Renormalizing Chomp ⋮ Cubic pisot unit combinatorial games ⋮ Geometrical extensions of Wythoff's game ⋮ Wythoff's sequence and \(N\)-heap Wythoff's conjectures ⋮ SELF-SIMILARITY OF 𝒫-POSITIONS OF (2n + 1)-DIMENSIONAL WYTHOFF’S GAME ⋮ On the complexity of the misère version of three games played on graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Coin-sliding and Go
- Modular Nim
- The complexity of pursuit on a graph
- Snakes in Domineering games
- Integral lexicographic codes
- Misère annihilation games
- A deletion game on hypergraphs
- The Sprague-Grundy function for Wythoff's game
- Epidemiography
- k-Welter - a generalization of Welter's game
- PSPACE-Hardness of some combinatorial games
- The generalized Sprague-Grundy function and its invariance under certain mappings
- Epidemiography. II: Games with a dozing yet winning player
- Blockbusting and domineering
- Properties of k-Welter's game
- Epidemiography with various growth functions
- Complexity of problems in games, graphs and algebraic equations
- A complete analysis of von Neumann's Hackendot
- Computing a perfect strategy for nxn chess requires time exponential in n
- Playing disjunctive sums is polynomial space complete
- Theory of annihilation games. I
- Some undecidable determined games
- Undirected edge geography
- On the complexity of some two-person perfect-information games
- How far can nim in disguise be stretched?
- Adjoining to Wythoff's game its P-positions as moves
- Additive periodicity of the Sprague-Grundy function of certain Nim games
- New values in Domineering
- A new heap game
- Extended thermography for multiple \(kos\) in Go
- Nim-type games
- Traveling salesmen in the presence of competition
- Complexities of winning strategies in diophantine games
- Solving \(8\times 8\) Domineering
- A generalization of Wythoff's game
- Succinct representations of graphs
- Lexicographic codes: Error-correcting codes from game theory
- Some combinatorial game problems require Ω( n k ) time
- Provably Difficult Combinatorial Games
- GO Is Polynomial-Space Hard
- The Pebbling Problem is Complete in Polynomial Space
- A Curious Nim-Type Game
- Theory of annihilation games
- How to Beat Your Wythoff Games' Opponent on Three Fronts
- Graphs and composite games
- The NP-completeness column: An ongoing guide
- The hexad game
This page was built for publication: Complexity, appeal and challenges of combinatorial games
