An algorithmic analysis of the honey-bee game

R. Fleischer, G.J. Woeginger

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

5 Citations (Scopus)

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.
Original languageEnglish
Title of host publicationFun with Algorithms (5th International Conference, FUN 2010, Iscia, Italy, June 2-4, 2010. Proceedings)
EditorsP. Boldi
Place of PublicationBerlin
PublisherSpringer
Pages178-189
ISBN (Print)978-3-642-13121-9
DOIs
Publication statusPublished - 2010

Publication series

NameLecture Notes in Computer Science
Volume6099
ISSN (Print)0302-9743

Fingerprint

Dive into the research topics of 'An algorithmic analysis of the honey-bee game'. Together they form a unique fingerprint.

Cite this