Changes of the outcome of combinatorial games with differing number of prohibited repetitions
Classical hierarchies from a modern standpoint. Part II. R-sets
Combinatorial games: Selected bibliography with a succinct gourmet introduction.
Combinatorics of Dyadic Intervals: Consistent Colourings
We study the problem of consistent and homogeneous colourings for increasing families of dyadic intervals. We determine when this problem can be solved and when it cannot.
Complex dynamics of an adnascent-type game model.