Return to the CS 32: Puzzles, Games & Algorithms homepage

CS 32: Lecture Notes

We will go over most of these notes during class. They are posted on this page so that students can review them. Titles that appear in bold have either been covered in class, or will be covered soon. Some of these notes will likely be modified during the course of the semester.

1. Conway’s Doomsday Algorithm [pdf].
2. Introduction to Puzzles and Games [pdf].
3. Word Jumbles Permutations and Factorial Trees [pdf].
4. Labyrinths and Mazes [pdf] (56.1MB).
5. Threading Mazes [pdf].
6. Anagrams and Factorials [pdf].
7. Introduction to Racket [pdf].
8. Elements of Racket [pdf].
9. River Crossing Puzzles [pdf].
10. Peg Solitaire: A Four Peg Puzzle [pdf].
11. The Tower of Hanoi [pdf].
12. Rubik’s Cube [pdf].
13. The Game of Nim [pdf].
14. Mancala Games [pdf].

The remaining topics will not be covered on the final exam:

1. Games of Chance [pdf].
2. Poker Probabilities [pdf].
3. The Birthday Paradox [pdf].