Goal node (computer science)
This article includes a list of references, related reading or external links, but its sources remain unclear because it lacks inline citations. (February 2018) (Learn how and when to remove this template message)
Heuristical artificial intelligence algorithms, like A* and B*, attempt to reach such nodes in optimal time by defining the distance to the goal node. When the goal node is reached, A* defines the distance to the goal node as 0 and all other nodes' distances as positive values.
- N.J. Nilsson Principles of Artificial Intelligence (1982 Birkhäuser) p. 63
|This artificial intelligence-related article is a stub. You can help Wikipedia by expanding it.|