In this thesis, we study combinatorial games under differentconventions. A combinatorial game is a finite acyclic two-player game withcomplete information and no chance. First, we look at impartial gamesin normal play and in particular at the games VertexNim and Timber.Then, we consider partizan games in normal play, with results on the gamesTimbush, Toppling Dominoes and Col. Next, we look at all these gamesin misère play, and study misère games modulo the dicot universe and modulothe dead-ending universe. Finally, we talk about the domination game which,despite not being a combinatorial game, may be studied with combinatorialgames theory tools.
