Math ClubWednesday February 17th, 2016 Time: 1:00 PM Title: Cookie Monster Plays Games Speaker: Tanya Khovanova , MIT Location: Physics P-117 Abstract: I will describe the results from three PRIMES projects that I mentored. In the first project we studied the cookie monster problem. In the second project we converted the cookie monster problem into an impartial combinatorial game. During the project we discovered a connection between this project and another project suggested by Richard Stanley on the generalization of the Ulam-Warburton Automaton. We found a bijection between the P-positions in the 3-pile Nim and three branches of the Ulam-Warburton automaton. We extended this bijection into the notion of an evolution graph for any impartial combinatorial game.