Best-first search techniques such as A* would have to visit
every state when applied to an optimization problem where the
largest value of objective function is not known.
a) Why does this have to be the case?
b) How does the use of local search techniques (such as
hill-climbing) allow us to "solve" such optimization problems?
Best-first search techniques such as A* would have to visit every state when applied to an optimization problem where th
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
Best-first search techniques such as A* would have to visit every state when applied to an optimization problem where th
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!