Lecture 27: Physics and Computation

Physics, reversibility and computation(PS)

Lecture 26: Randomized Algorithms

Primality testing, Treaps, n-queens, counting-solutions (TXT,PDF)

Lecture 25: More Chess Programming

Zobrist keys, killer moves, etc. (TXT)

Lecture 24: Chess Programming

Chess Programming (TXT,PDF)

Lecture 23: Games II

(PDF, PS)

Lecture 22: Games

Basic game searching and alpha-beta (TXT)

Lecture 21: Graphs IV

A more detailed exploration of depth first search. (TXT, PDF)

Lecture 20: Graphs III

This is a lecture on all-pairs-shortest-paths, and on minimum spanning trees. (TXT PDF)

Lecture 19: Graphs II

Single-source shortest path algorithms (PS)

Lecture 18: Graphs

Introduction to graphs PS

Lecture 17: Quicksort

Quicksort PS

Lecture 16: Sorting

Introduction to sorting PS

Lecture 15: Burrows-Wheeler Compression

We describe the Burrows-Wheeler compression algorithm (html, PDF)

Lecture 14: Compression II

This lecture reviewed Huffman trees, discussed Kolmogorov-Chaitin complexity,
and described the Lempel-Ziv-Welch (LZW) algorithm. (PS)

Lecture 13: Huffman Compression

Lecture 13: information, codes, Huffman compression 6up

Lecture 12: Heaps

Lecture 12: Order statistics and heaps 6up

Lecture 11: 2-3-4 Trees

Lecture 11: 234-Trees 6up

Lecture 10: Binary Search Trees II (Splay Trees)

Binary Search Trees II (PDF) (TXT)

Lecture 5: Hashing (Open Addressing)

Hashing (Open Addressing)

Lecture 4: Hashing (Chaining)

Hashing (Chaining)
Professor Sleator also presented this implementation in java.