AI · Theory

Bidirectional Search Algorithm

Theory

82/215

Bidirectional Search Algorithm

Bidirectional Search Algorithm 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.

Bidirectional Search Algorithm — output — three exam lines. Graph on paper first.

For Bidirectional Search Algorithm: 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

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

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

Short notes

DefBidirectional Search Algorithm — how we walk the state graph.
RuleBidirectional Search Algorithm — visited set.
RememberBidirectional Search Algorithm — heuristic or not?

AI · Theory

Bidirectional Search Algorithm

← All stacks

Theory

82/215

Bidirectional Search Algorithm

Bidirectional Search Algorithm — output — three exam lines. Graph on paper first.

For Bidirectional Search Algorithm: 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

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

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

Short notes

DefBidirectional Search Algorithm — how we walk the state graph.
RuleBidirectional Search Algorithm — visited set.
RememberBidirectional Search Algorithm — heuristic or not?

Bidirectional Search Algorithm

Example

Short notes

Questions

Bidirectional Search Algorithm

Example

Short notes

Questions