raduion6395 raduion6395
  • 11-07-2020
  • Computers and Technology
contestada

If we used an inadmissible heuristic in A* tree search, could it change the completeness of the search?

Respuesta :

batolisis
batolisis batolisis
  • 12-07-2020

Answer:

No

Explanation:

If we used an inadmissible heuristic in A* tree search, it cannot  change the completeness of the search, and this is because as long as a heuristic function is bounded, then A* tree search would visit all the nodes available  and would definitely find a path to an existing goal

A* tree search is a  search strategy that is used to find and establish an efficient path between points, and the node in a search tree can be visited several times  as well

Ver imagen batolisis
Answer Link

Otras preguntas

What does this sign mean??
Is water a solution? no yes
How do you write 7.369E6 in standard form?
A red car and a blue car collide. What would be an example of Locard's exchange principle in this situation? Group of answer choices The owner of the red car w
Which transition most likely indicates that an author is using the cause and effect text structure? A-above B-leads to C-just as D-however
The nth term of 1, 4, 16, ... is (Simplify your answer.)
Which expression is equivalent to -4(8 - 3)?
What is the value of x in the equation x - y = 30, when y = 15? O 4 O 8 O 80 O 200
What is aerobic exercise? A. Exercise that uses large muscle groups to move your body B. Exercise that uses small muscle groups to move your body C. Exercise th
Solve for v. 8=v+2 plz help​