5.4 Greedy Search

  • Intuition: Choose the node with the smallest (estimated) cost to the goal.

    [Example of Greedy Search & Heuristics]

  • Not optimal

  • Complete only if duplicates maintained
[MAIN PAGE] [PREVIOUS PAGE] [NEXT PAGE]
RMiT Copyright © 1999. Department of Computer Science, RMIT University.
Last Modified: 17th June, 1999.