AI · Theory

Iterative Deepening Search (IDS) or Iterative Deepening Depth First Search (IDDFS)

Theory

126/215

Iterative Deepening Search (IDS) or Iterative Deepening Depth First Search (IDDFS)

Iterative Deepening Search (IDS) or Iterative Deepening Depth First Search (IDDFS) 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.

Iterative Deepening Search (IDS) or Iterative Deepening Depth First Search (IDDFS) — output: three exam lines. Graph on paper first.

For Iterative Deepening Search (IDS) or Iterative Deepening Depth First Search (IDDFS): 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

# Iterative Deepening Search (IDS) or Iterative Deepening Depth First Search (IDDFS)
print("draw 6 nodes")
print("name the DS: queue / stack / priority")
print("say if the path is optimal")

Iterative Deepening Search (IDS) or Iterative Deepening Depth First Search (IDDFS) — output: three exam lines. Graph on paper first.

Short notes

DefIterative Deepening Search (IDS) or Iterative Deepening Depth First Search (IDDFS) — how we walk the state graph.
RuleIterative Deepening Search (IDS) or Iterative Deepening Depth First Search (IDDFS) — visited set.
RememberIterative Deepening Search (IDS) or Iterative Deepening Depth First Search (IDDFS) — heuristic or not?

AI · Theory

Iterative Deepening Search (IDS) or Iterative Deepening Depth First Search (IDDFS)

← All stacks

Theory

126/215

Iterative Deepening Search (IDS) or Iterative Deepening Depth First Search (IDDFS)

Iterative Deepening Search (IDS) or Iterative Deepening Depth First Search (IDDFS) — output: three exam lines. Graph on paper first.

For Iterative Deepening Search (IDS) or Iterative Deepening Depth First Search (IDDFS): 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

# Iterative Deepening Search (IDS) or Iterative Deepening Depth First Search (IDDFS)
print("draw 6 nodes")
print("name the DS: queue / stack / priority")
print("say if the path is optimal")

Iterative Deepening Search (IDS) or Iterative Deepening Depth First Search (IDDFS) — output: three exam lines. Graph on paper first.

Short notes

DefIterative Deepening Search (IDS) or Iterative Deepening Depth First Search (IDDFS) — how we walk the state graph.
RuleIterative Deepening Search (IDS) or Iterative Deepening Depth First Search (IDDFS) — visited set.
RememberIterative Deepening Search (IDS) or Iterative Deepening Depth First Search (IDDFS) — heuristic or not?

Iterative Deepening Search (IDS) or Iterative Deepening Depth First Search (IDDFS)

Example

Short notes

Questions

Iterative Deepening Search (IDS) or Iterative Deepening Depth First Search (IDDFS)

Example

Short notes

Questions