Best First Search is a heuristic search algorithm used in artificial intelligence and graph theory, always expanding the most promising node first. The algorithm uses a heuristic function to evaluate each node