Skip to Main content Skip to Navigation
Theses

Combinatorial games on graphs

Abstract : 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.
Complete list of metadatas

https://tel.archives-ouvertes.fr/tel-00919998
Contributor : Abes Star :  Contact
Submitted on : Tuesday, December 17, 2013 - 3:52:12 PM
Last modification on : Thursday, January 11, 2018 - 6:20:16 AM
Long-term archiving on: : Saturday, April 8, 2017 - 7:29:29 AM

File

RENAULT_GABRIEL_2013.pdf
Version validated by the jury (STAR)

Identifiers

  • HAL Id : tel-00919998, version 1

Collections

Citation

Gabriel Renault. Combinatorial games on graphs. Other [cs.OH]. Université Sciences et Technologies - Bordeaux I, 2013. English. ⟨NNT : 2013BOR14937⟩. ⟨tel-00919998⟩

Share

Metrics

Record views

417

Files downloads

1663