algorithm - Why does iterative deepening A star not need to test for duplicate states? -
iterative deepening star (id a*) memory bounded search. question when reach new state s'
open state s
in id a*, why not test whether s'
in "open states" or "closed states"?
for problem, e.g.: sudoku, state never reached twice, because "graph of states of problem" tree. however, other problem, e.g.: 8-puzzle, reach state again , again. so, should tested whether state "visited" (either in open or closed states) or not.
if such tests have done, id a* not memory bounded anymore because large hash table of possible states has stored.
we don't test whether s' duplicate in order keep memory profile small. in general, ida* will, in fact, expand same state multiple times.
Comments
Post a Comment