A
Modern
Approach
to Artificial Intelligence
1. Introduction
Overview
2. Intelligent Agents
Overview
3. Solving Problems by Searching
Overview
Search Algorithms
Best-first search
Breadth-first search
Dijkstras algorithm
Depth-limited search
Bidirectional search
Greedy best-first search
A∗ search
Iterative deepening search
Overview of Search Algorithms
4. Search in Complex Environments
Overview
Search Algorithms
Hill-climbing Search
Simulated annealing
Local beam search
Evolutionary algorithms
5. Constraint Satisfaction Problems
Overview
6. Adversarial Search and Games
Overview
7. Logical Agents
Overview
8. First-Order Logic
Overview
First-Order Logic Algorithms
Syntax and Semantics of First-Order Logic
Using First-Order Logic
Knowledge Engineering
9. Inference in First-Order Logic
Overview
Inference Rule Algorithms
Simple forward-chaining
Backward Chaining
10. Knowledge Representation
Overview
11. Automated Planning
Overview
12. Quantifying Uncertainty
Overview
13. Probabilistic Reasoning
Overview
📚 Resources
Loading...
What is a key feature of local search algorithms?
They keep track of all paths explored.
They use a significant amount of memory.
They operate without keeping track of paths or states reached.
They guarantee finding the global optimum.
Submit
Show Quiz & Discussion