I have my Finite Math class studying tournament graphs. Yesterday we had a tournament using "The Game of Sprouts", invented by John H. Conway (hello John!) and Michael Paterson. I found out about this game in an article in the Amer. Math. Monthly, May 1993. It really provided a fun way to teach some graph concepts.
Anyway, I was wondering if any work has been done on strategies for this game. Is there a winning strategy for the first (or second) player? I've worked out a few rules of thumb based on parity of exposed vertices. The article cited above just deals with what graphs can arise.
Thanks in advance for any help. My students expect me to play the winner. Guess I had better win, huh? The efficacy of mathematical training hangs in the balance.... ;+)
Bill Haloupek U of Wisconsin-Stout email@example.com