Games without Chance: Combinatorial Game Theory

Georgia Tech studies games in which the moves are governed by rules rather than random events. Comparing positions, simplifying games and examining impartial play provide a route into mathematical structure. It suits learners who enjoy turning a familiar activity into a precise problem and want to understand why a strategy works, beyond trying moves until one succeeds.

What you will learn

• Analyze simple games without random moves.
• Compare positions and simplify game expressions.
• Explore impartial games and mathematical strategy.

Who this suits

Learners interested in mathematical games and proof-based reasoning; the provider assigns a mixed level, so inspect the opening examples before committing.

Before you enroll

Work through examples with a written argument rather than relying on an answer alone. Check definitions, quantifiers and boundary cases, and distinguish a model’s assumptions from the situation it represents. These courses take different routes through discrete mathematics; compare their preparation requirements and topic coverage before choosing a starting point.

Coursera offers paid enrollment or subscription access. Check the enrollment screen for assessment and certificate terms, trials and any financial-aid options. Provider access terms can change; review them before paying.

Put it into practice

Choose a small game position and list its legal moves. Analyze the resulting positions, propose a winning strategy and explain which rule makes the argument valid.

Source and review

This overview is based on the provider's published information, checked on 12 October 2026. It is an editorial assessment, not a claim that we completed the resource. Time filters are approximate study ranges; projects and exercises can take longer.

View the curriculum and current access options at Coursera.

How YellowCourse describes and checks learning resources.