Article
Licensed
Unlicensed
Requires Authentication
On the Complexity of n-Player Hackenbush
-
Alessandro Cincotti
Published/Copyright:
January 26, 2010
Abstract
Why are n-player games much more complex than two-player games? Is it much more difficult to cooperate or to compete? n-player Hackenbush is an n-player version of Blue-Red Hackenbush, a classic two-player combinatorial game played on graphs. Because of queer games, i.e., games where no player has a winning strategy, cooperation is a key-factor in n-player games and, as a consequence, n-player Hackenbush played on strings is 
-complete.
Received: 2008-11-05
Accepted: 2009-08-08
Published Online: 2010-01-26
Published in Print: 2009-December
© de Gruyter 2009
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- On the Complexity of n-Player Hackenbush
- On the Equation ax ≡ x (mod b)
- A New Generalization of Fibonacci Sequence & Extended Binet's Formula
- On Rainbow Solutions to an Equation with a Quadratic Term
- 2-Pile Nim with a Restricted Number of Move-Size Imitations
- The Finite Heine Transformation and Conjugate Durfee Squares
- A Short Note on the Difference Between Inverses of Consecutive Integers Modulo p
- Factorization Results with Combinatorial Proofs
- Squares in (12 + m2) ⋯ (n2 + m2)
- On Monochromatic Sets of Integers Whose Diameters Form a Monotone Sequence
- Palindromes in Different Bases: A Conjecture of J. Ernest Wilkins
- Une forme effective d'un théorème de Bateman sur la fonction phi d'Euler
- Differences of Multiple Fibonacci Numbers
Articles in the same Issue
- On the Complexity of n-Player Hackenbush
- On the Equation ax ≡ x (mod b)
- A New Generalization of Fibonacci Sequence & Extended Binet's Formula
- On Rainbow Solutions to an Equation with a Quadratic Term
- 2-Pile Nim with a Restricted Number of Move-Size Imitations
- The Finite Heine Transformation and Conjugate Durfee Squares
- A Short Note on the Difference Between Inverses of Consecutive Integers Modulo p
- Factorization Results with Combinatorial Proofs
- Squares in (12 + m2) ⋯ (n2 + m2)
- On Monochromatic Sets of Integers Whose Diameters Form a Monotone Sequence
- Palindromes in Different Bases: A Conjecture of J. Ernest Wilkins
- Une forme effective d'un théorème de Bateman sur la fonction phi d'Euler
- Differences of Multiple Fibonacci Numbers
