Register
Every optimal search strategy is necessarily complete True False
13.8k views
1 vote
Every optimal search strategy is necessarily complete

True
False

User Riina
by
7.9k points

1 Answer

5 votes
The answer is false because every optimal search strategy is necessarily complete. because BFS is complete and optimal where dfs is not when there are loops.
User ThePosey
by
7.8k points
Ask a Question
Welcome to QAmmunity.org, where you can ask questions and receive answers from other members of our community.

8.3m questions

10.9m answers

Other Questions

“What does it mean when we “rework” copyrighted material?”
The book shows how to add and subtract binary and decimal numbers. However, other numbering systems are also very popular when dealing with computers. The octal (base 8) numbering system is one of these.
Seven basic internal components found in a computer tower
describe an advance in technology that makes life more enjoyable. what discoveries contribute to this technology?
Disadvantages of using animation in advertising? advantages and disadvantages of using animation for education? advantages and disadvantages of using animation in entertainment?
Link Copied!