The complexity of Free-Flood-It on 2×n boards

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.

[1]  Aurélie Lagoutte,et al.  Jeux d'inondation dans les graphes , 2010 .

[2]  Kitty Meeks,et al.  The complexity of flood-filling games on graphs , 2011, Discret. Appl. Math..

[3]  Raphaël Clifford,et al.  The Complexity of Flood Filling Games , 2011, Theory of Computing Systems.

[4]  Gerhard J. Woeginger,et al.  An Algorithmic Analysis of the Honey-Bee Game , 2010, FUN.

[5]  Kitty Meeks,et al.  Spanning Trees and the Complexity of Flood-Filling Games , 2012, Theory of Computing Systems.

[6]  Eric Thierry,et al.  Flooding games on graphs , 2014, Discret. Appl. Math..

[7]  Xin-She Yang,et al.  Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.

[8]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.