CPSC 201: Introduction to Computer Science
Instructor: Carsten Schürmann
Department of Computer Science
Yale University
Time: MWF 11:30-12:20
Room: AKW200
|
|
Home |
|
|
Schedule |
|
|
Handouts |
|
|
Assignments |
|
|
Projects |
|
|
Links |
Lecture 32
In this lecture we continue our presentation from the previous lecture and describe two very powerful search strategies: The A* algorithm, and the mini-max algorithm. A* is a heurstic search algorithm, and mini-max is an algorithm useful for game playing where two players play against each other.