A* algorithm is based on
(a) Breadth-First-Search
(b) Depth-First –Search
(c) Best-First-Search
(d) Hill climbing
please answer!
(e) Bulkworld Problem.
Answers
Answered by
1
Answer:
mark me brainlist
Explanation:
a) To discover something or an idea embedded in a program
b) To search and measure how far a node in a search tree seems to be from a goal
c) To compare two nodes in a search tree to see if one is better than another
d) All of the mentioned
Similar questions