AI · Theory

Exhaustive Search

Theory

127/215

Exhaustive Search

Exhaustive Search is a search strategy. Say the data structure, whether it uses a heuristic, and if it guarantees a shortest path. Draw a tiny 6-node graph. That is the exam, not a textbook proof.

Exhaustive Search — output — three exam lines. Graph on paper first.

For Exhaustive Search — always mark visited nodes or you loop. Say complexity in plain words: time vs memory trade-off.

Diagram

start
    ├── BFS  queue
    ├── DFS  stack
    └── A*   g+h
    │
    ▼
   goal

Exam tip

DS + heuristic yes/no + optimality.

Example

# Exhaustive Search
print("draw 6 nodes")
print("name the DS: queue / stack / priority")
print("say if the path is optimal")

Exhaustive Search — output: three exam lines. Graph on paper first.

Short notes

DefExhaustive Search — how we walk the state graph.
RuleExhaustive Search — visited set.
RememberExhaustive Search — heuristic or not?

AI · Theory

Exhaustive Search

← All stacks

Theory

127/215

Exhaustive Search

Exhaustive Search is a search strategy. Say the data structure, whether it uses a heuristic, and if it guarantees a shortest path. Draw a tiny 6-node graph. That is the exam, not a textbook proof.

Exhaustive Search — output — three exam lines. Graph on paper first.

For Exhaustive Search — always mark visited nodes or you loop. Say complexity in plain words: time vs memory trade-off.

Diagram

start
    ├── BFS  queue
    ├── DFS  stack
    └── A*   g+h
    │
    ▼
   goal

Exam tip

DS + heuristic yes/no + optimality.

Example

# Exhaustive Search
print("draw 6 nodes")
print("name the DS: queue / stack / priority")
print("say if the path is optimal")

Exhaustive Search — output: three exam lines. Graph on paper first.

Short notes

DefExhaustive Search — how we walk the state graph.
RuleExhaustive Search — visited set.
RememberExhaustive Search — heuristic or not?

Exhaustive Search

Example

Short notes

Questions

Exhaustive Search

Example

Short notes

Questions