An algorithmic analysis of the honey-bee game

Authors:
Rudolf Fleischer;Gerhard J. Woeginger
Affiliations:
School of Computer Science, IIPL, Fudan University, Shanghai, China;Department of Mathematics and Computer Science, TU Eindhoven, Eindhoven, The Netherlands
Venue:
FUN'10 Proceedings of the 5th international conference on Fun with algorithms
Year:
2010

Citing 2
Cited 2

More on the complexity of common superstring and supersequence problems

Theoretical Computer Science
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

The complexity of flood-filling games on graphs

Discrete Applied Mathematics
Spanning trees and the complexity of flood-filling games

FUN'12 Proceedings of the 6th international conference on Fun with Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

The HONEY-BEE game is a two-player board game that is played on a connected hexagonal colored grid, or in a generalized setting, on a connected graph with colored nodes. In a single move, a player calls a color and thereby conquers all nodes of that color that are adjacent to his own territory. Both players want to conquer the majority of the nodes. We show that winning the game is PSPACE-hard in general, NP-hard on series-parallel graphs, but easy on outerplanar graphs. The solitaire version, where the goal is to conquer the entire graph with a minimum number of moves, is NP-hard on trees and split graphs, but can be solved in polynomial time on co-comparability graphs.