Objectives of the Episode
In this Episode, we learn how to grab a single piece of cheese in a maze using algorithms called traversals. In particular, we study two algorithms: the breadth-first search, and the depth-first search.
Articles to study before the Lab
Work to do for the next episode
- Finish the implementation of the program in Lab 3;
- Study the articles of Episode 4;
- Be prepared for the 5-minute interview during the next Lab, in which you’ll have to present the work done in Lab 3.
Important! It is important to be prepared for this interview (see evaluation sheet for details). You should have your programs ready for a demo, and have your codes already open not to lose time searching for them. Having figures ready (if you have some) is already a good way of saving time. Remember that 5 minutes is extremely short.