With the finding that g(n) = g*(n) for any expanded n, an A* uses a consistent heuristic to find the optimal routes to all extended nodes.
Is this a heuristic function that is acceptable?
- An algorithm is a process for executing a program step-by-step.An algorithm (/aelrm/ (listen)) is a finite series of precise instructions used in mathematics and computer science to solve a class of specific problems or perform a computation.
- Algorithms are used as specifications for carrying out calculations and processing data.
- Advanced algorithms can reroute the execution of the code along many paths by performing automated deductions (also known as automated reasoning) and using logical and mathematical tests (referred to as automated decision-making).
- Alan Turing was the first to refer to human characteristics as metaphorical representations of computers using terms like "memory," "search," and "stimulus."
- On the other hand, a heuristic is a problem-solving method that, particularly in problem domains, may not be completely defined or may not always result in the best or most accurate solutions.
To learn more about heuristic function refer
https://brainly.com/question/29353200
#SPJ4