State Space Search Formulation

Resolution: Automated Logical Inference

Genetic and Evolutionary Algorithms

Simulated Annealing

Hill Climbing and Its Limitations

Expectiminimax for Stochastic Games

Alpha-Beta Pruning

Adversarial Search: Minimax Algorithm

Weighted A* and Memory-Bounded Search

A* Search Algorithm

Greedy Best-First Search

Consistency (Monotonicity) of Heuristics

Heuristic Functions and Admissibility

Evaluating Search Algorithms

Iterative Deepening DFS

Uniform-Cost Search

Depth-First Search (DFS)

Uninformed Search: Breadth-First Search

Search Tree vs Graph Representation

Formulating Problems as State-Space Search

Symbolic AI vs Machine Learning

Knowledge Representation for Classical AI

Branch and Bound Basics

Dynamic Programming as Optimization

Linear Programming and Simplex Method

Convex vs Non-Convex Landscapes

CSP Heuristics: MRV, Degree, LCV

Constraint Propagation and Arc Consistency

Backtracking Search for CSPs

CSP Formulation Essentials

Backtracking Search for CSPs

Evaluation Functions and Cutoff

Classical Planning with STRIPS

DFS Properties and Complexity

Gradient vs Derivative-Free

Local Beam Search

Admissibility of Heuristics

Bidirectional Search

Expectimax and Stochastic Games

CSP Ordering Heuristics

Genetic Algorithms

Complexity Analysis of Search

Memory-Bounded Search

Consistency of Heuristics

Greedy Best-First Behavior

State Space and Branching Factor

Completeness vs Optimality

A* Search Mechanics

Simulated Annealing

Knowledge Representation and Inference

Monte Carlo Tree Search

Minimax for Adversarial Search

Repeated States and Explored Set

Alpha-Beta Pruning

Arc Consistency and AC-3

BFS Properties and Complexity

Iterative Deepening A*

Iterative Deepening Trade-offs

Hill Climbing Pitfalls

Uniform Cost Search Optimality

Linear and Convex Optimization

CSP Formulation

Heuristic Dominance

Backtracking Forgets To Undo

Hill Climbing Wrong Direction

Beam Search Keeps Worst Nodes

AC-3 Revise Inverted Test

Genetic Algorithm Broken Crossover

Dijkstra Relaxation Drops Edge Weight

MRV Picks The Wrong Variable

Simulated Annealing Sign Error

Linear Programming Basics

Gradient vs Derivative-Free Optimization

Exploration vs Exploitation

Expectimax for Stochastic Games

Objectives, Constraints, Feasible Regions

Global vs Local Optima

Monte Carlo Tree Search

Branch and Bound Inverted Prune

BFS Node-Count Estimate

Search Completeness Table

Bellman Update Missing Reward

Bellman-Ford Relaxation Count

Minimax Value Backup

Consistent Heuristic Check

Priority Queue Tie-Breaking

Depth-Limited Minimax With Eval

Visited Set To Avoid Revisits

Reconstructing Path From Parents

Expectimax Chance Node Averaging

Alpha-Beta Pruning Cutoff

Iterative Deepening Depth Limit

Admissible Heuristic Check

A* f = g + h Evaluation

Uniform Cost Priority Expansion

Bidirectional Search Meeting Point

Greedy Best-First Node Selection

BFS Frontier Order

DFS Stack Behavior

Simulated Annealing

Backtracking Search for CSPs

Evaluation Functions and Depth Limits

Alpha-Beta Pruning

Genetic Algorithms

Local vs Systematic Search

CSP Ordering Heuristics

Arc Consistency and AC-3

CSP Formulation

Beam Search

Hill Climbing and Local Optima

Minimax Algorithm

Uniform Cost Search

Heuristic Design and Dominance

A* Search Algorithm

Breadth-First Search (BFS)

Uninformed vs Informed Search

Bidirectional Search

Greedy Best-First Search

Admissibility and Consistency

Iterative Deepening DFS

Search Algorithm Properties

Depth-First Search (DFS)