  We define a new impartial combinatorial game, Flag Coloring, based on flood
filling. We then generalize to a graph game, and find values for many positions
on two colors. We demonstrate that the generalized game is PSPACE-complete for
two colors or more via a reduction from Avoid True, determine the outcome
classes of games based on real-world flags, and discuss remaining open
problems.
