Spanning trees and the complexity of flood-filling games
We consider 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. We show that the minimum number of moves required to flood any given graph G is equal to the minimum, taken ov...
| Auteurs principaux: | , |
|---|---|
| Format: | Journal article |
| Langue: | English |
| Publié: |
2012
|