which of the following is complete in a finite search space
Answers
Answered by
0
Answer:
hh
Explanation:
hihuuuuhhhhhyiotspydpyrptdotdpydydppydit)6"(5"85*74"96_pyrzoyrxpyrz
Answered by
2
Answer:
The best-first search is complete in a finite search space.
Explanation:
Search space is something that we used in an algorithm. Search space can be of different types such as finite or infinite. This is an important term that is used in artificial intelligence.
In any method, whether it is a finite or infinite search space, we calculate the time and storage complexities of the algorithm. Based on these complexities we can decide which one has the best time complexity or which one has the worst time complexity.
Similar questions