- MoveGen
- DFS
- BFS
- DFID
- Reading B&B Trees
- Rete Algorithm

Question Papers

Week 1: Introduction, History & Philosophy of AI
Week 2: State Space Search and Blind Search Algorithms
Week 3: Heuristic Search and Local Search
Week 4: Stochastic Local Search and Genetic Algorithms
Week 5: Optimal Search and Algorithm A*
Week 6: Variations of A* and Pruning Strategies
Week 7: Game Playing and Adversarial Search
Week 8: Planning
Week 9: Advanced Planning and Problem Decomposition

ConceptsWeek 5 — Optimal TSP

Week 5 — Optimal TSP

How to read any BnB search tree from the papers — number of cities, refinement order, optimal tour, and why the numbers increase toward leaves

Reading a TSP Branch-and-Bound Tree
How to read any BnB search tree from the papers — number of cities, refinement order, optimal tour, and why the numbers increase toward leaves