ECE 457A - Co-operative and Adaptive Algorithms

Midterm Info

• Date: Friday, February 27
• Time: 4:30 PM - 6:00 PM

Search Algorithms

• Properties of Search Algorithms
• Uninformed vs. Informed Search

Uninformed Search

• Breadth-First Search
• Depth-First Search
  • BFS vs DFS
• Depth-Limited Search
• Uniform Cost Search
• Iterative Deepening Search
• Comparing Search Strategies
• Avoiding Cycles and Repeated States

Informed Search

• Informed Search
• Heuristic
  • 8-Queens Heuristic Example
  • Admissible Heuristic Design
• Weak vs. Strong Methods
• Best-First Search
• Greedy Best-First Search
• Beam Search
• A Search
• A* Search
• Hill Climbing Search

Assignments

• 457A Assignment 1