Discussion
What distinguishes local search from the search methods discussed so far?
Answer: A
Local search moves from one complete state to a neighbour, keeping no path and no frontier, which suits problems where the goal state itself is the answer and the route to it is irrelevant. Timetabling and layout problems are typical. Memory is constant regardless of the space's size. Heuristics, graphs and direction are shared with other methods. Discarding the path when the path is not wanted is what buys the enormous memory saving.
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