a) Linear approach
b) Heuristic approach (Some knowledge is stored)
c) Random approach
d) An Optimal approach
Answer: b
Explanation: We use a Heuristic approach, as it will find out brute force computation, looking at hundreds of thousands of positions. e.g Chess competition between Human and AI based Computer.
Related Posts
How many successors are generated in backtracking search?
When is breadth-first search is optimal?
How many types are available in uninformed search method?
Which search is implemented with an empty first-in-first-out queue?
Which search strategy is also called as blind search?
Which search method takes less memory?
A production rule consists of ____________
Join The Discussion