Papers for Euler Circle Combinatorial Game Theory, Summer 2021 Session 2

• Aathma Muruganathan: Two kinds of nim
• Alex Cao: A winning strategy in the angel and devil problem
• Anirudh Bharadway: Combinatorial games and computational complexity
• Archi Kanungo: Maker-breaker games
• Arindam Kulkarni: 3 player games
• Arjun Kulkarni: The angel and devil problem
• Caleb Dastrup: The surreal numbers and omnific integers
• Chris Bao: Bidding games
• Daniel Seo: Mancala-like games
• Eddie Fujimori: Mancala-like games
• Eric Cohan: Surreal numbers
• Evan Chang: Three player games
• Grant Koh: Combinatorial game theory and go endgames
• Isaac Lee: Classic impartial games
• Ishwar Suriyaprakash: Classical impartial games
• Jacob Lee: Strategies to win as the angel
• Jacob Rubenstein: Applications of combinatorial game theory to popular combinatorial games
• Kaiwen Xiao: Winning strategies for Wythoff's game
• Neil Makur: The game of konane
• Om Awate, Sarth Chavan, and Arkan Manva: An overview of surreal numbers
• Robert Yang: Introduction to Richman and Poorman games
• Roger Fan: Error correcting codes from combinatorial game theory
• Rohan Kalluraya, Elias Leventhal, and Mehana Ellis: Mancala-like games
• Rohan Das: Impartial games
• Ryan Clayton: Cop-win graphs in cops and robbers
• Saksham Diwan: Bidding games
• Sarthak Mitra: Combinatorial constructions
• Shikhar Mukherji: Nim with many players
• Shivatmica Murgai: Reduced canonical form
• Srinivas Arun: Computational results for bidding games
• Tej Nadkarni and Aryan Agarwal: The angel and devil problem
• Varun Rao, Edward Beckon, and Simon Seignourel: Cops and robbers
• Victor Donchenko: Computational complexity
• Vrushank Prakash: Games with entailing moves
• Yutao Mao and Dongshen Peng: Scoring games
• Yuvraj Sarda: Combinatorial constructions for error-correcting codes