The Game of timber!
Résumé
We analyse timber, a game played on a graphs. We find the P-positions for both normal and misère play on paths and show how to win the game. In passing, we also show a correspondence with Dyck paths, the Catalan and Fine numbers. We present an algorithm for winning the Normal Play game on trees.
Domaines
Mathématique discrète [cs.DM]
Origine : Fichiers produits par l'(les) auteur(s)
Loading...