Graph Theory and the Game of Sprouts

From MaRDI portal





This paper applies graph theory concepts to the game of sprouts. In this game the players begin with a finite set of \(m\) points. On their turn a player adds an edge between two existing vertices (or a loop at a single vertex) and then subdivides the added edge with a new vertex. The resulting configuration must be planar and no vertex can have degree exceeding 3. The game is played until no further moves are possible. The winner of the game is the player who makes the last move. The author establishes that the number of plays in a complete game of sprouts on \(m\) points is between \(2m\) and \(3m - 1\). When the final graph is 2-connected the lower bound is \((7m - 2)/3\).











This page was built for publication: Graph Theory and the Game of Sprouts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3139920)