Spelling suggestions: "subject:"dlacement same"" "subject:"dlacement game""
1 |
Simplicial Complexes of Placement GamesHuntemann, Svenja 15 August 2013 (has links)
Placement games are a subclass of combinatorial games which are played on graphs. In this thesis, we demonstrate that placement games could be considered as games played on simplicial complexes. These complexes are constructed using square-free monomials.
We define new classes of placement games and the notion of Doppelgänger. To aid in exploring the simplicial complex of a game, we introduce the bipartite flip and develop tools to compare known bounds on simplicial complexes (such as the Kruskal-Katona bounds) with bounds on game complexes.
|
Page generated in 0.0747 seconds