The zero forcing game on a simple, undirected graph G is based on the so-called color change rule which can be stated as if some vertices on G are colored black while others are white and vertex v is a black vertex with ...