Before revision: For tree search problems, if an admissible heuristic is used, the A* search algorithm will never return a suboptimal goal node .
After revision: The A* search algorithm requires an admissible heuristic to ensure the path it returns is optimal .