The complexity of flood filling games
FUN'10 Proceedings of the 5th international conference on Fun with algorithms
The Complexity of Flood Filling Games
Theory of Computing Systems - Special Issue: Fun with Algorithms
The complexity of flood-filling games on graphs
Discrete Applied Mathematics
An algorithmic analysis of the Honey-Bee game
Theoretical Computer Science
Spanning trees and the complexity of flood-filling games
FUN'12 Proceedings of the 6th international conference on Fun with Algorithms
| Hi-index | 5.23 |
We consider the complexity of problems related to the combinatorial game Free-Flood-It, in which players aim to make a coloured graph monochromatic with the minimum possible number of flooding operations. Our main result is that computing the length of an optimal sequence is fixed parameter tractable (with the number of colours as a parameter) when restricted to rectangular 2xn boards. We also show that, when the number of colours is unbounded, the problem remains NP-hard on such boards. These results resolve a question of Clifford, Jalsenius, Montanaro and Sach.