Autor:	Stewart, Fraser
Rok vydání:	2012
Předmět:	Mathematics - Combinatorics
Druh dokumentu:	Working Paper
Popis:	Hackenbush is a two player game, played on a graph with coloured edges where players take it in turns to remove edges of their own colour. It has been shown that under normal play rules Red-Blue Hackenbush (all edges are coloured either red or blue) is NP-hard. We will show that Red-Blue Hackenbush is in P, but that Red-Blue-Green Hackenbush is NP-Hard, when played under mis\`ere rules.
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/1202.4658 Zobrazit plný text záznamu View this record from Arxiv