-
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: domineering
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 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 IX
Lesson 9 Typically, at the end of a Domineering game, the board is divided into disjoint components, so the overall game is the (game) sum of the individual components. Suppose we have the following 6 components: How should the next … Continue reading
Combinatorial Game Theory VI
Lesson 6 General Combinatorial Game Theory [ Warning: the following lesson is significantly longer than the previous ones. ] Starting from this lesson, we will look at a more rigourous, complete and general theory. Prior to this, in any game configuration both … Continue reading
Mathematics and Such 