Jump to ContentJump to Main Navigation
Show Summary Details
More options …

 

Integers


Mathematical Citation Quotient (MCQ) 2017: 0.20

Online
ISSN
1867-0660
See all formats and pricing
More options …

On the Complexity of n-Player Hackenbush

Alessandro Cincotti
  • School of Information Science, Japan Advanced Institute of Science and Technology, Japan. E-mail:
  • Other articles by this author:
  • De Gruyter OnlineGoogle Scholar
Published Online: 2010-01-26 | DOI: https://doi.org/10.1515/INTEG.2009.049

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.

Keywords.: Hackenbush; n-player games; complexity

About the article

Received: 2008-11-05

Accepted: 2009-08-08

Published Online: 2010-01-26

Published in Print: 2009-12-01


Citation Information: Integers, Volume 9, Issue 6, Pages 621–627, ISSN (Print) 1867-0652, DOI: https://doi.org/10.1515/INTEG.2009.049.

Export Citation

Comments (0)

Please log in or register to comment.
Log in