Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:01563259n
Noun Named Entity
Categories: Search algorithms, Graph algorithms, Routing algorithms, Game artificial intelligence
EN
Iterative deepening A*  IDA*
EN
Iterative deepening A* is a graph traversal and path search algorithm that can find the shortest path between a designated start node and any member of a set of goal nodes in a weighted graph. Wikipedia
Definitions
Relations
Sources
EN
Iterative deepening A* is a graph traversal and path search algorithm that can find the shortest path between a designated start node and any member of a set of goal nodes in a weighted graph. Wikipedia
heuristic pathfinding algorithm Wikidata
IS A
informed search algorithm
BASED ON
iterative deepening depth-first search
DESCRIBED BY SOURCE
Artificial Intelligence: A Modern Approach
NAMED AFTER
A* search algorithm
SOLVES
shortest path problem
USES
tree
Wikipedia
EN
Iterative deepening A*
Wikidata
EN
iterative deepening A*
Wikipedia Redirections
EN
IDA*
Wikidata Alias
EN
IDA*

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License