Definition
Could you now describe an AI task as an agent problem, choose a search method, play a game well, solve a timetable, reason with logic and handle uncertainty?
This review brings together Problem Solving and Reasoning: agents and environments, problem formulation, uninformed and informed search including A*, local search, minimax and alpha-beta pruning, constraint satisfaction, propositional and first-order logic, knowledge representation and expert systems, automated planning, Bayesian networks and fuzzy logic, followed by a scored quiz.
In simple words
Read the recap table, try the activities, then take the quiz. Each answer comes with an explanation. If you miss one, go back to that topic.
Why it matters
Classical AI methods remain at work in route planning, games, scheduling, verification and rule systems, and they are increasingly combined with machine learning. Knowing them lets you choose the right tool and understand hybrid systems.
How it works
| Topic | Key idea |
|---|---|
| Agents | PEAS; environment properties; reflex, model-based, goal-based, utility-based and learning agents |
| Search | Formulate states and actions; BFS, DFS, uniform-cost; A* with an admissible heuristic |
| Local search | Hill climbing, restarts, simulated annealing, genetic algorithms |
| Games | Minimax backs up values; alpha-beta prunes without changing the result |
| Constraints | Variables, domains, constraints; backtracking with propagation and MRV |
| Logic and knowledge | Propositional and first-order logic; rules, expert systems, knowledge graphs |
| Planning | Preconditions and effects; STRIPS and PDDL; heuristic planners |
| Uncertainty and vagueness | Bayesian networks for uncertainty; fuzzy logic for degrees of truth |
Try it yourself
Match the problem to the method
Which classical AI method fits best?
- Shortest route on a road map
- Choosing a move in chess
- An exam timetable with no clashes
- Diagnosing a fault from uncertain symptoms
- Smooth control of a fan from temperature
Guaranteed optimal?
Does each method guarantee the best solution (under its usual conditions)?
A* with an admissible heuristic
Uniform-cost search with positive costs
Hill climbing
Depth-first search
Greedy best-first search
Common mistakes
- Using uninformed search on huge problems without heuristics.
- Using an overestimating heuristic with A* and trusting optimality.
- Confusing probability with fuzzy degrees of truth.
Check yourself
Summary
- Agents, search, games, constraints, logic, planning and uncertain reasoning form the classical AI toolkit.
- Know each method's guarantees: optimality, completeness and cost.
- Modern AI often combines these methods with machine learning.
Finished reading?
Sources: Russell and Norvig, Artificial Intelligence: A Modern Approach (4th edition) · UC Berkeley CS188: Introduction to Artificial Intelligence