Objectives of the Episode
We saw at the last episode that we can collect all the pieces of cheese in the maze using a greedy algorithm. This type of algorithm does not necessarily provide the shortest path for this collection, but a good-enough one.
In this episode, we are going to introduce you to combinatorial game theory, that formalizes what it means to win a game, or have a strategy.
This course should be seen as an opening course (note that there is still a quiz next time). We will not ask you to write a program realizing what you will learn here, but of course you can do if you want 🙂
Articles to study before the Lab
Test your knowledge of this Episode!
Lab instructions
Follow this link for the Lab contents!
Work to do for the next episode
- Finish coding the greedy algorithm if you need more time;
- Work on your AI for the tournament.