and then choose one of those successors to be the next current node this is the basic idea of local search it typically uses much less memory than classical search algorithms like A*-search, and in ...