This ongoing research looks at mis’ere games from a combinatorial game theory approach. Projects are centred around using computer programming to find solutions to games on graphs. Research projects often engage inter-university collaborations and student research assistants through programs like WISE (Women In Science and Engineering) and a collaborative research grant from the Atlantic Association for Research in the Mathematical Sciences (AARMS).
Examples of this research can be found in:
McKay, N.A., Milley, R., and Nowakowski, R.J., Hackenbush sprigs, International Journal of Game Theory, 2015, 2015, 10.1007/s00182-015-0484-8 (online only for now).
Milley, R., Partizan Kayles and misere invertibility, Integers: Electronic Journal of Combinatorial Number Theory, 15, 2015.
Milley, R. and Renault, G., Dead ends in mis`ere play: the mis`ere monoid of canonical numbers, Discrete Mathematics, 313(20), 2013.
Milley, R., Nowakowski, R.J., and Ottaway, P., The mis`ere monoid of one-handed alternating games, Integers: Electronic Journal of Combinatorial Number Theory, 12B (2012).
