Heuristic search, such as A, can be shown to be effective (e.g. guaranteeing that the optimal solution can be found) and efficient
computer science
Description
Heuristic search, such as A, can be shown to be effective (e.g. guaranteeing that the optimal solution can be found) and efficient (e.g. it is faster because it searches a smaller portion of the search space) for some applications, particularly those involving finding the shortest path in real-world navigations.
Describe how a heuristic search can be designed for the problem of games. In your answer, you are required to state out the assumptions of the problem and provide technical arguments why your heuristic search would work effectively for the problem. Finally, discuss how you can measure the efficiency of your search methodology. Answer in no more than 500-words.
