Pages that link to "Alpha–beta pruning"
Appearance
Showing 50 items.
- Evolutionarily stable strategy (links | edit)
- Game theory (links | edit)
- John von Neumann (links | edit)
- List of algorithms (links | edit)
- Minimax (links | edit)
- Rock paper scissors (links | edit)
- Search algorithm (links | edit)
- Tragedy of the commons (links | edit)
- Tree (abstract data type) (links | edit)
- Tic-tac-toe (links | edit)
- Zero-sum game (links | edit)
- Sprague–Grundy theorem (links | edit)
- Shortest path problem (links | edit)
- Prisoner's dilemma (links | edit)
- Nash equilibrium (links | edit)
- Pareto efficiency (links | edit)
- Dijkstra's algorithm (links | edit)
- Deep Blue (chess computer) (links | edit)
- Kruskal's algorithm (links | edit)
- Prim's algorithm (links | edit)
- Solved game (links | edit)
- Computer chess (links | edit)
- Bounded rationality (links | edit)
- Satisficing (links | edit)
- Homo economicus (links | edit)
- Arrow's impossibility theorem (links | edit)
- Breadth-first search (links | edit)
- Depth-first search (links | edit)
- A* search algorithm (links | edit)
- Best-first search (links | edit)
- Collusion (links | edit)
- Daniel Kahneman (links | edit)
- Amos Tversky (links | edit)
- Beta (links | edit)
- Killer heuristic (links | edit)
- Null-move heuristic (links | edit)
- Borůvka's algorithm (links | edit)
- Shapley value (links | edit)
- Combinatorial search (links | edit)
- Appeasement (links | edit)
- Bellman–Ford algorithm (links | edit)
- Computer Go (links | edit)
- Floyd–Warshall algorithm (links | edit)
- Rendezvous problem (links | edit)
- Transposition table (links | edit)
- Tit for tat (links | edit)
- Combinatorial game theory (links | edit)
- Game complexity (links | edit)
- Perfect information (links | edit)
- Outline of combinatorics (links | edit)