2022年度 組合せゲーム理論入門   Introduction to Combinatorial Game Theory

文字サイズ 

アップデートお知らせメールへ登録 お気に入り講義リストに追加
開講元
情報工学系
担当教員名
BONNET FRANCOIS PIERRE ANDRE 
授業形態
講義    (ハイフレックス型)
メディア利用科目
曜日・時限(講義室)
集中講義等   
クラス
-
科目コード
CSC.T255
単位数
2
開講年度
2022年度
開講クォーター
2Q
シラバス更新日
2022年3月16日
講義資料更新日
-
使用言語
英語
アクセスランキング
media

講義の概要とねらい

英語講義のみ。

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.

到達目標

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.

キーワード

Combinatorial Games, Surreal Numbers, Sprague-Grundy Theorem, Subtraction games, Nim(bers), Recreational Mathematics, CGSuite.

学生が身につける力(ディグリー・ポリシー)

専門力 教養力 コミュニケーション力 展開力(探究力又は設定力) 展開力(実践力又は解決力)

授業の進め方

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.

授業計画・課題

  授業計画 課題
第1回 序論 授業時に指示する.
第2回 帰結類 授業時に指示する.
第3回 ゲームの直和 授業時に指示する.
第4回 ゲームの代数 授業時に指示する.
第5回 ゲームの値 授業時に指示する.
第6回 不偏ゲーム 授業時に指示する.
第7回 超現実数、ゲームの温度、全微小ゲーム、。。。 授業時に指示する.

教科書

- 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.

参考書、講義資料等

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.

成績評価の基準及び方法

Exercises during classes and homework.
The assessment method will be adapted if the course cannot be held face-to-face.

関連する科目

  • None
  • None

履修の条件(知識・技能・履修済科目等)

- Basic notions of Mathematics; in particular the notion of Proof by Induction.
- Interest in mathematical games and puzzles (aka recreational mathematics).

その他

Remarks:
- If allowed at that time, lecture will be given face-to-face and onsite attendance will be strongly recommended.
- The course schedule is probably optimistic. There may not be enough time to present all topics.

このページのトップへ