Discussion
What is greedy best first search?
Answer: B
Greedy search ignores the cost already incurred and always heads for whatever looks closest to the goal, which is often very fast and often produces a poor path. Path cost ordering is uniform cost and the sum of the two is A star. It is neither complete in general nor optimal, which is the price of ignoring half the information available. An algorithm that discards a term and gains speed is worth understanding precisely because A star is what results from putting the term back.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development