▶Japanese
Post to SNS
- Home
- > School of Computing
- > Undergraduate major in Computer Science
- > Introduction to Combinatorial Game Theory
- School of Science
-
School of Engineering
- Undergraduate major in Mechanical Engineering
- Undergraduate major in Systems and Control Engineering
- Undergraduate major in Electrical and Electronic Engineering
- Undergraduate major in Information and Communications Engineering
- Undergraduate major in Industrial Engineering and Economics
- Common courses
- School of Materials and Chemical Technology
- School of Computing
- School of Life Science and Technology
- School of Environment and Society
- 工学院，物質理工学院，環境・社会理工学院共通科目
- Liberal arts and basic science courses
- First-Year Courses
- School of Science
- School of Engineering
- School of Materials and Chemical Technology
- School of Computing
- School of Life Science and Technology
-
School of Environment and Society
- Department of Architecture and Building Engineering
- Department of Civil and Environmental Engineering
- Department of Transdisciplinary Science and Engineering
- Department of Social and Human Sciences
- Department of Innovation Science
- Graduate major in Technology and Innovation Management
- Common courses
- Liberal arts and basic science courses
- Academic unit or major
- Undergraduate major in Computer Science
- Instructor(s)
- Bonnet Francois Pierre Andre
- Class Format
- Lecture (Face-to-face)
- Media-enhanced courses
- Day/Period(Room No.)
- Intensive ()
- Group
- -
- Course number
- CSC.T255
- Credits
- 2
- Academic year
- 2023
- Offered quarter
- 2Q
- Syllabus updated
- 2023/3/20
- Lecture notes updated
- -
- Language used
- English
- Access Index
-
Course description and aims
This course gives an introduction to Combinatorial Game Theory (CGT). CGT studies two-player deterministic games with perfect-information (e.g. Nim, Domineering, Grundy's game, Wythoff's game, Hex, Go, ...). In combinatorial games, the loser is typically the player who is left without legal moves. The main goal of CGT is to determine the winner of a game, while assuming perfect play of both players. The lecture introduces the fundamental notions of game outcomes and values, and explain how to compute them; first for simple games and then for sums of games. In addition to games, the closely related notion of Surreal Numbers will be presented.
Remarks: This course is not a machine learning course and does not include any programing exercises. Therefore, topics such as implementing a good AI to play games (e.g. alphaZero) are out of scope.
Student learning outcomes
Students will:
1) Discover the mathematical beauty of Combinatorial Game Theory,
2) Understand the notions of outcome, values, and sum of games,
3) Be able to study and solve such combinatorial games.
More generally, students will improve their ability to study complex problems.
Keywords
Combinatorial Games, Surreal Numbers, Sprague-Grundy Theorem, Subtraction games, Nim(bers), Recreational Mathematics, CGSuite.
Competencies that will be developed
| ✔ Specialist skills | Intercultural skills | Communication skills | Critical thinking skills | Practical and/or problem-solving skills |
Class flow
Typical classes will alternate between slide-based presentations, interactive discussions (between students and/or with teacher), class exercises. Active contribution to class discussions will be required.
Course schedule/Required learning
| Course schedule | Required learning | |
|---|---|---|
| Class 1 | Introduction | Instructed in class. |
| Class 2 | Exercises | Instructed in class. |
| Class 3 | Outcome Classes | Instructed in class. |
| Class 4 | Exercises | Instructed in class. |
| Class 5 | Sums of Games | Instructed in class. |
| Class 6 | Exercises | Instructed in class. |
| Class 7 | Algebra of Games | Instructed in class. |
| Class 8 | Exercises | Instructed in class. |
| Class 9 | Values of Games | Instructed in class. |
| Class 10 | Exercises | Instructed in class. |
| Class 11 | Impartial Games | Instructed in class. |
| Class 12 | Exercises | Instructed in class. |
| Class 13 | More advanced topics; surreal numbers, hot games, all-small games, ... | Instructed in class. |
| Class 14 | Exercises | Instructed in class. |
Textbook(s)
- Lessons in Play: An Introduction to Combinatorial Game Theory, Second Edition, by Michael H. Albert, Richard J. Nowakowski, and David Wolfe
- 組合せゲーム理論入門 －勝利の方程式－, by Michael H. Albert, Richard J. Nowakowski, and David Wolfe, translated by 川辺 治之訳
Remarks:
- Buying the textbook is not required.
- The Japanese book is the translation of the first edition of the English book.
Reference books, course materials, etc.
In addition to the textbook, the following books may be used during the course:
- Winning Ways for Your Mathematical Plays (Volumes 1-4), by Elwyn R. Berlekamp, John H. Conway, and Richard K. Guy
- Surreal Numbers: How Two Ex-Students Turned on to Pure Mathematics and Found Total Happiness, by Donald E. Knuth
- On numbers and games, by John. H. Conway
- Combinatorial Game Theory, by Aaron N Siegel
Remarks:
- Students are not expected to read these books.
- The last two books are are much more advanced than this course.
Assessment criteria and methods
Exercises during classes and homework.
Related courses
- None
- None
Prerequisites (i.e., required knowledge, skills, courses, etc.)
- Interest in mathematical games and puzzles (aka recreational mathematics).
- Basic notions of Mathematics; in particular the notion of Proof by Induction.
Other
Remarks:
- This year, lecture will be given only face-to-face. There will be no remote option.
- The course schedule is optimistic. There will not be enough time to present all advanced topics.
IMPORTANT:
- This course is an intensive course given for a week in September, probably second-half of September. Exact schedule will be decided later and posted in T2SCHOLA.
- If you register and cannot attend anymore (e.g. due to conflicting internship), please contact the teacher before the beginning of the course.
