Algorithms
General
Data structures
Game theory
Search and planning, path finding
- Search algorithm
- Path finding
- Shortest path problem
- State space
- State space search
- State space planning
- Combinatorial search
- Game tree
- Heuristic
- Backward induction
- Branch and bound
- Minimax
- Alpha–beta pruning
- Dynamic programming
- Contraction hierarchies
- Breadth-first search
- Depth-first search
- Iterative deepening depth-first search
- Bidirectional search
- Greedy algorithm
- Best-first search
- Bellman–Ford algorithm
- Dijkstra’s algorithm
- A* search
- Jump point search
- B* search
- D* search
- Any-angle path planning