Sprouts is a Combinatorial Games Conference oriented towards undergraduate research, created as a joint collaboration between the University of New England and Plymouth State University. Sprouts is also a combinatorial game that is especially popular in the Netherlands.
Events in Marcil 124 unless otherwise noted.
This talk is a quick introduction to Combinatorial Game Theory. It covers outcome classes, sums, nimbers, numbers, switches, and infinitesimals (up and down). (slides - pdf)
Machine learning has become an increasingly important branch of AI. This talk provides a brief overview of what machine learning is and how it can be applied to CGT.
Using some Java-based Col players, we created a system to disply the current state of the match using JavaScript and file I/O.
Tafl games are old precursors to modern chess, and involve asymmetric play. Usually partisan and loopy, they are quite difficult to analyze. We look at a few highly simplified impartial short variants with the hope of applying CGT methods to this ancient and interesting family of games. (slides - pdf)
There is no cost to register for this conference. Please email Kyle () if you plan to attend, so we can plan ahead for you. We'll do whatever we can to accommodate as many people as possible. We don't expect more than 30, but we'll be happy to include whomever we can.
Ryan Arbuckle, Lauren Hayden, Robert Kram, Emily Menichelli, Nathan Mozinski, Nick Paolini, Jillian Spero, Anonymous (1).
Thanks to the Mathematical Sciences Department at the University of New England for providing us with space for the talks.
Additionally, thanks to the Plymouth State Computer Science and Technology department for funding participation for Kyle Burke and his students.
Other Combinatorial Games conferences