Extremal properties of flood-filling games
From MaRDI portal
Publication:5226850
Abstract: The problem of determining the number of "flooding operations" required to make a given coloured graph monochromatic in the one-player combinatorial game Flood-It has been studied extensively from an algorithmic point of view, but basic questions about the maximum number of moves that might be required in the worst case remain unanswered. We begin a systematic investigation of such questions, with the goal of determining, for a given graph, the maximum number of moves that may be required, taken over all possible colourings. We give several upper and lower bounds on this quantity for arbitrary graphs and show that all of the bounds are tight for trees; we also investigate how much the upper bounds can be improved if we restrict our attention to graphs with higher edge-density.
Recommendations
Cited in
(9)- Spanning trees and the complexity of flood-filling games
- On complexity of flooding games on graphs with interval representations
- Efficient approaches for the flooding problem on graphs
- The complexity of flood filling games
- The complexity of flood-filling games on graphs
- How Bad is the Freedom to Flood-It?
- Algorithms and Computation
- Flooding games on graphs
- A Survey on the Complexity of Flood-Filling Games
This page was built for publication: Extremal properties of flood-filling games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5226850)
