Name
Abstract | ||
|---|---|---|
polish is a game based on the 'Cleaning with Brushes' model. It is a combinatorial game in the sense of Conway but can be seen as a graph searching or chip-firing problem as well. We consider only the impartial version and give a characterization of graphs with maximum degree two that are first player wins. We also show that the second player can win on the complete graph K"n provided n=3 and the complete bipartite graph K"2","n provided n1,3. We give the nim-values for all positions on paths, stars, and also the nim-values for complete bipartite graphs where every vertex needs at most 3 more brushes to fire. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1016/j.tcs.2012.05.014 | Theor. Comput. Sci. |
Keywords | DocType | Volume |
cleaning game,player win,maximum degree,complete graph K,impartial version,combinatorial game,chip-firing problem,complete bipartite graph K,vertex need,complete bipartite graph | Journal | 463, |
ISSN | Citations | PageRank |
0304-3975 | 0 | 0.34 |
References | Authors | |
9 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Przemysaw Gordinowicz | 1 | 0 | 0.34 |
| Richard J. Nowakowski | 2 | 441 | 142.85 |
| Pawe Praat | 3 | 27 | 2.84 |