October 21, 2019

Monday of Week 9

Topic of the day

| Reading | Online | Questions | Assignments | Photos |

Suggested readings

Online references

Questions and exercises

  1. Why is best-first search an improvement over Dijkstra's algorithm?
  2. What is the problem with using greedy best-first search?
  3. In a brief definition: what makes a heuristic admissible?

Assignments

Today

Upcoming

Board photo