| Webster's Online Dictionary |
| Expressions | Domain | Definition | |
| Best first search | Computing | Best first search A graph search algorithm which optimizes breadth first search by ordering all current paths according to some heuristic. The heuristic attempts to predict how close the end of a path is to a solution. Paths which are judged to be closer to a solution are extended first. See also beam search, hill climbing. (1995-12-09). Source: The Free On-line Dictionary of Computing.. | |
Source: compiled by the editor from various references; see credits. | Top | ||
