Groups
Category
Hill climbing is an iterative optimization method that repeatedly moves to a better neighboring solution until no improvement is possible, reaching a local optimum.
Complete search enumerates every candidate solution, while backtracking prunes branches that cannot possibly lead to a valid or better solution.