Prolog Search Algorithms

?
  • Created by: Ella_Kay
  • Created on: 23-06-17 14:55
View mindmap
  • Search Algorithms
    • Breadth First Search Termination: G if S Optimal: G Complete: G Vulnerable: No
      • Informed BF
        • Greedy Best First Terminnat.: –G Optimal: –G Complete: –G Vulnerable: Si
        • A* Termination:  G **     Optimal: G ** Complete: G ** Vulnerable: No
          • h is admissible (never overestimates costs) All cost bounded w positive constant
      • Uninformed BF
        • Uniform Cost Termination: G if S Optimal: G Complete: G Vulnerable: No
    • Depth First Search Termination: not G even if S Optimal: –G Complete: –G Vulnerable: Si
      • Informed DF
      • Uninformed DF

Comments

No comments have yet been made

Similar Computing resources:

See all Computing resources »See all Learn Prolog NOW resources »