-
Recent Posts
Archives
- March 2023
- January 2023
- May 2020
- April 2020
- March 2020
- June 2018
- July 2016
- June 2016
- May 2016
- March 2015
- February 2015
- January 2015
- December 2014
- December 2013
- November 2013
- July 2013
- June 2013
- May 2013
- March 2013
- February 2013
- January 2013
- December 2012
- November 2012
- October 2012
- September 2012
- August 2012
- April 2012
- March 2012
- February 2012
- January 2012
- December 2011
- November 2011
- October 2011
Categories
Meta
Pages
Tag Archives: toads and frogs
Combinatorial Game Theory Quiz 3
The quiz lasts 75 minutes and covers everything from lessons 1-12. For each of the following Nim games, find one good move for the first player, if any. (10 points) [ Note : exactly one of the games is a … Continue reading
Combinatorial Game Theory XII
Lesson 12 Recall the following Domineering configuration in lesson 10: The above game has a nice theory behind it. Definition : For any game G, the game –G (called miny–G) is defined to be: The game +G (called tiny–G) is defined … Continue reading
Posted in Notes
Tagged combinatorial game theory, computer science, domineering, game infinitesimals, impartial games, intermediate, minies, tinies, toads and frogs
1 Comment
Combinatorial Game Theory XI
Lesson 11 In this lesson, we will cover more on canonical forms. First recall that for m↑ + (*n) with m > 0, this game is positive except when (m, n) = (1, 1). Let’s consider the canonical forms of … Continue reading
Combinatorial Game Theory X
Lesson 10 In lesson 7, we learnt that if A, B are Left’s options in a game with A ≥ B, then we can drop B from the list of options and the game remains equal. In this lesson, we will … Continue reading
Combinatorial Game Theory VIII
Lesson 8 In this lesson, we will further familiarise ourselves with games involving numbers. At the end of the lesson, we will encounter our first positive infinitesimal: the “up” ↑. Here, an infinitesimal is a value which is strictly between –r and r … Continue reading