~/ learn/ comp-456/ cards/ Backtracking & and/or graphs
1 of 2

In the backtrack algorithm, what do SL, NSL, and DE hold?

In the backtrack algorithm, what do SL, NSL, and DE hold?

Answer

SL = current solution path; NSL = states awaiting evaluation; DE = dead ends

SL is the path being explored (front = current state CS); NSL is discovered-but-unevaluated states; DE records failed states so search never re-enters them. In open/closed terms, CLOSED = SL ∪ DE.

space flip · ← → navigate · esc to exit
NORMAL ~/memra/library/c8dd5aa7-e75b-4340-94ab-fa9d3e6eb4e1/flashcard utf-8 LF