Computer Science, asked by uniworldpriyanka, 10 months ago

9
In Best First search Algorithm, the node expands
(1 Point)
When we identify the successor node of n
When we check whether OPEN is empty
When we remove the node n with the estimated goal
When we check successor node n is the goal node.​

Answers

Answered by nihalbag77
0

Answer:

No problem i dont know dont know about it only math

Similar questions