5. Search: Optimal, Branch and Bound, A*
48:17
6. Search: Games, Minimax, and Alpha-Beta
24:42
7.3 Traveling Salesman Problem - Branch and Bound
47:19
1. Introduction and Scope
19:22
The hidden beauty of the A* algorithm
24:02
La carrera por explotar el poder de la computación cuántica | The Future con Hannah Fry
48:42
4. Search: Depth-First, Hill Climbing, Beam
49:56
10. Introduction to Learning, Nearest Neighbors
1:03:43