com.thesett.aima.search.util.informed.package.html Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of aima Show documentation

Library of code developed from 'Artificial Intelligence a Modern Approach', Prentice Hall.

There is a newer version: 0.8.3

Provides 'heuristic' or 'informed' search algorithms. The following algorithms can be found in this package: Greedy Search. Always takes the node with the best heurisitc first. A-Star Search. Always takes the node with the highest f value first (where f = heuristic + cost). Iterative Deepening A-Star Search. Same as A-Star but proceeds iteratively with increasing values of f. F-Bounded Search. Searches up to an f limit (where f = heuristic + cost).

For an admissable heuristic the A-Star algorithm is guaranteed to find the lowest cost path to the goal.