Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

© 2026 Vinony · Knowledge from Wikipedia, Wikidata, and 27 public APIs.

iterative deepening A* · Vinony

EntityQ5477480· pop 6· linked from 39 articles

iterative deepening A*

Sign in to save

heuristic pathfinding algorithm

Connections

Bellman–Ford algorithm

International Standard Book Number

digital object identifier

Dijkstra's algorithm

dynamic programming

depth-first search

breadth-first search

search algorithm

Prim's algorithm

minimum spanning tree

A* search algorithm

Kruskal's algorithm

time complexity

graph data structure

Categories

Game artificial intelligence Graph algorithms Routing algorithms Search algorithms

Sources

wikipedia.externallinksexternallink

What links here39 pages

Optimal solutions for Rubik's Cube

Floyd–Warshall algorithm

Dijkstra's algorithm

Johnson's algorithm

bidirectional search

breadth-first search

iterative deepening depth-first search

Simplified Memory-Bounded A*

graph traversal

depth-first search

jump point search

Bellman–Ford algorithm

Monte Carlo tree search

Edmonds' algorithm

Borůvka's algorithm

A* search algorithm

General Problem Solver

Reverse-delete algorithm

Similar entities

Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).

least-cost routing

Entitydist 0.62

Adaptive optimization

Entitydist 0.69

The Incredible Adventures of Van Helsing

Entitydist 0.69

Von Neumann neighborhood

Entitydist 0.69

Entitydist 0.70

Split horizon route advertisement

Entitydist 0.71

Powerset construction

Entitydist 0.71

Category:Iterative methods

Entitydist 0.72

Slow-growing hierarchy

Entitydist 0.72

hyperparameter optimization

Entitydist 0.72

Category:TEN-T Core Network Corridors

Entitydist 0.72

Entitydist 0.73