Combinatorial game theory is a branch of mathematics and computer science that studies two-player games with perfect information. It has contributed new methods for analyzing game trees, such as surreal numbers, and has had successes in analyzing Go endgames. It can be helpful to distinguish between combinatorial "mathgames" and "playgames". Examples of these include Nim, tic-tac-toe, chess, checkers, and Go.
Carnegie Mellon University
Fall 2021
This course provides a comprehensive introduction to Discrete Mathematics, emphasizing the application of these concepts in Computer Science. Topics include counting, recurrence relations, combinatorial games, Polya theory, and more.
No concepts data
+ 13 more concepts