Explanation: None. 4. Which is identical to the closed list in Graph search?
A. Hill climbing search algorithm
B. Depth-first search
C. Transposition table
D. None of the mentioned
Answer:A
Explanation: None. 4. Which is identical to the closed list in Graph search?
A. Hill climbing search algorithm B. Depth-first search C. Transposition table D. None of the mentioned
Explanation: None. 5. Which function is used to calculate the feasibility of whole game tree?