Galton-Watson games
We address two-player combinatorial games whose graph of positions is a directed Galton-Watson tree. We consider normal and misère rules (where a player who cannot move loses or wins respectively), as well as an “escape game” in which one designated player loses if either player cannot move. We stud...
| Main Authors: | , |
|---|---|
| פורמט: | Journal article |
| שפה: | English |
| יצא לאור: |
Wiley
2021
|