A* search
E1343102
UNEXPLORED
A* search is a widely used informed search algorithm in artificial intelligence that finds optimal paths by combining actual path cost with a heuristic estimate of the remaining cost.
All labels observed (2)
| Label | Occurrences |
|---|---|
| A* search canonical | 1 |
| A* search algorithm | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T18787685 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: A* search Context triple: [MIT course 6.034 Artificial Intelligence, coversTopic, A* search]
-
A.
Dijkstra
Dijkstra is a renowned Dutch computer scientist best known for his pioneering work in algorithms, including Dijkstra's shortest path algorithm, and for his influential contributions to programming methodology and software engineering.
-
B.
Generalized Search Tree
Generalized Search Tree is a flexible, balanced tree data structure framework that supports building custom index types for complex data and queries, often used in database systems.
-
C.
Dijkstra's shortest path algorithm
Dijkstra's shortest path algorithm is a classic graph algorithm that efficiently computes the minimum-cost paths from a single source vertex to all other vertices in a weighted graph with non-negative edge weights.
-
D.
Monte Carlo tree search
Monte Carlo tree search is a heuristic search algorithm that uses random sampling of game states to build and explore a search tree, enabling strong decision-making in complex domains like Go and other board games.
-
E.
SeARCH
SeARCH is a Dutch architecture and urban design firm known for its innovative, context-sensitive projects that often integrate buildings seamlessly into their natural surroundings.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: A* search Target entity description: A* search is a widely used informed search algorithm in artificial intelligence that finds optimal paths by combining actual path cost with a heuristic estimate of the remaining cost.
-
A.
Dijkstra
Dijkstra is a renowned Dutch computer scientist best known for his pioneering work in algorithms, including Dijkstra's shortest path algorithm, and for his influential contributions to programming methodology and software engineering.
-
B.
Generalized Search Tree
Generalized Search Tree is a flexible, balanced tree data structure framework that supports building custom index types for complex data and queries, often used in database systems.
-
C.
Dijkstra's shortest path algorithm
Dijkstra's shortest path algorithm is a classic graph algorithm that efficiently computes the minimum-cost paths from a single source vertex to all other vertices in a weighted graph with non-negative edge weights.
-
D.
Monte Carlo tree search
Monte Carlo tree search is a heuristic search algorithm that uses random sampling of game states to build and explore a search tree, enabling strong decision-making in complex domains like Go and other board games.
-
E.
SeARCH
SeARCH is a Dutch architecture and urban design firm known for its innovative, context-sensitive projects that often integrate buildings seamlessly into their natural surroundings.
- F. None of above. chosen
Referenced by (2)
Full triples — surface form annotated when it differs from this entity's canonical label.
linked to: A* search