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
I had been asked this question in a job interview.
This key question is from Alpha Beta Pruning topic in section Adversarial Search of Artificial Intelligence