Hill climbing is also called which of the following ………. local search because it takes a good neighbor state without thinking ahead about where to go next.

In computer science, local search is a heuristic method for solving computationally hard optimization problems. Local search can be used on problems that can be formulated as finding a solution maximizing a criterion among a number of candidate solutions.