Tag Archives: computer science

Combinatorial Game Theory V

Lesson 5 We did mention in the first lesson that CGT covers games without draws. Here, we’ll break this rule and look at loopy games, i.e. games with possible draws. [ To be specific, loopy games are those where it’s … Continue reading

Posted in Notes | | 5 Comments

Combinatorial Game Theory Quiz 1

This quiz lasts 70 minutes and covers materials from lessons 1-4. For A-C, determine whether the following Nim games are first or second-player wins. There is no need to find the winning move. (10 points) (10, 15, 17, 19) (7, … Continue reading

Combinatorial Game Theory IV

Lesson 4 In this lesson, we will work on a large class of games, known as take-and-break games. First consider a simple example. Kayles Kayles is an example of a take-and-break game: Start with a few heaps of contiguous bottles, … Continue reading

Posted in Notes | | 1 Comment

Combinatorial Game Theory III

Lesson 3 We’ve learnt Nim and we’ve learnt the Square Game. Now, let’s combine them and consider the following game, which we shall nameĀ Nim Square. Start with r heaps of stones, of sizes . Play alternates between two players: at … Continue reading