Properties of greedy search Complete?? Chapter 4,Sections 1-2 11
Properties of greedy search Complete?? Chapter 4, Sections 1–2 11
Properties of greedy search Complete??No-can get stuck in loops,e.g.,with Oradea as goal, lasi,Neamt→lasi→Neamt→ Complete in finite space with repeated-state checking Time?? Chapter 4.Sections 1-2 12
Properties of greedy search Complete?? No–can get stuck in loops, e.g., with Oradea as goal, Iasi → Neamt → Iasi → Neamt → Complete in finite space with repeated-state checking Time?? Chapter 4, Sections 1–2 12