Yousef's Notes
/
AI Reasoning
Brief History
Agents
Environments
Structure of Agents
Goal-based Agents
Learning Agents
Model-based Reflex Agents
Simple Reflex Agents
Utility-based Agents
Formulation of Agent Problems
Inner Working of Agents
Agent Representation
Algorithms
A* Search
AC-3
Alpha-Beta Search
And-Or Search
Backtracking Search
Beam Search
BFS
Bi-directional Heuristic Search
Bi-directional Search
Depth-Limited Search
DFS
Evolutionary Algorithms
Graph Search
Greedy Best-First Search
Heuristic Search
Hierarchical Search
Hill-Climbing Search
Iterative Deepening Search
Iterative-Deepening A* Search (IDA*)
Learning Real-Time A* (LRTA*)
Local Search for CSPs
Minimax
Monte Carlo Tree Search
Online DFS
Online Local Search
Recursive Best-First Search (RBFS)
Satisficing Search
Simplified Memory-Bounded A* (SMA*)
Simulated Annealing
Uniform Cost Search (Dijkstra)
Alpha-Beta Pruning
AND-OR Search Trees
Automated Planning
Basic Search Algorithms
Belief State
Class Notes
Competitive Games
Conditional Plan
Constraint Satisfaction Problem
Execution
First Order Logic
Heuristic Alpha-Beta Tree Search
Heuristic Functions
Inference in CSPs
Informed Search Strategies
Knowledge Representation
Limitations of Game Search Algorithms
Local Search
Local Search in Continuous Space
Monte Carlo Tree Search
Non-deterministic Actions
Online Search Agents
Online Search Problems
Partially Observable Games
Performance
Properties of Algorithms
Rationality
Search in Partially Observable Environments
Search Problem
Search with No Observations
Sliding Tile Puzzle
Solving CSPs
Stochastic Games and Evaluation Functions
Two-player zero-sum games
Uncertain Knowledge
Uninformed Search Strategies
Vacuum Problem
Wumpus World
Sliding Tile Puzzle
Sliding Tile Puzzle
Search with No Observations
Solving CSPs
Test yourself on
QuizBuilder.ai
Search with No Observations