The complexity of flood filling games
From MaRDI portal
Abstract: We study the complexity of the popular one player combinatorial game known as Flood-It. In this game the player is given an n by n board of tiles where each tile is allocated one of c colours. The goal is to make the colours of all tiles equal via the shortest possible sequence of flooding operations. In the standard version, a flooding operation consists of the player choosing a colour k, which then changes the colour of all the tiles in the monochromatic region connected to the top left tile to k. After this operation has been performed, neighbouring regions which are already of the chosen colour k will then also become connected, thereby extending the monochromatic region of the board. We show that finding the minimum number of flooding operations is NP-hard for c>=3 and that this even holds when the player can perform flooding operations from any position on the board. However, we show that this "free" variant is in P for c=2. We also prove that for an unbounded number of colours, Flood-It remains NP-hard for boards of height at least 3, but is in P for boards of height 2. Next we show how a c-1 approximation and a randomised 2c/3 approximation algorithm can be derived, and that no polynomial time constant factor, independent of c, approximation algorithm exists unless P=NP. We then investigate how many moves are required for the "most demanding" n by n boards (those requiring the most moves) and show that the number grows as fast as Theta(n*c^0.5). Finally, we consider boards where the colours of the tiles are chosen at random and show that for c>=2, the number of moves required to flood the whole board is Omega(n) with high probability.
Recommendations
Cites work
- scientific article; zbMATH DE number 1024108 (Why is no real title available?)
- scientific article; zbMATH DE number 1944412 (Why is no real title available?)
- Drawing borders efficiently
- Dynamic monopolies of constant size
- First passage percolation for random colorings of \(\mathbb{Z}^ d\)
- Minesweeper is NP-complete.
- On the Approximation of Shortest Common Supersequences and Longest Common Subsequences
- On time versus size for monotone dynamic monopolies in regular topologies
- Probability Inequalities for Sums of Bounded Random Variables
- Size bounds for dynamic monopolies
- Tetris is Hard, Even to Approximate
- The Complexity of Some Problems on Subsequences and Supersequences
- The density of interfaces: a new first-passage problem
- The shortest common supersequence problem over binary alphabet is NP- complete
Cited in
(17)- Flooding games on graphs
- On complexity of flooding games on graphs with interval representations
- How bad is the freedom to Flood-It?
- scientific article; zbMATH DE number 1944412 (Why is no real title available?)
- A Survey on the Complexity of Flood-Filling Games
- How Bad is the Freedom to Flood-It?
- Algorithms, kernels and lower bounds for the flood-it game parameterized by the vertex cover number
- On the complexity of Two Dots for narrow boards and few colors
- The Flood-It game parameterized by the vertex cover number
- The complexity of free-flood-it on \(2\times n\) boards
- The complexity of flood-filling games on graphs
- Spanning trees and the complexity of flood-filling games
- Extremal properties of flood-filling games
- Efficient approaches for the flooding problem on graphs
- Quell
- Parameterized complexity of flood-filling games on trees
- Tractability and hardness of flood-filling games on trees
This page was built for publication: The complexity of flood filling games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q692938)
