Artificial intelligence for games
From MaRDI portal
Recommendations
Cites work
- A comparison of minimax tree search algorithms
- A minimax algorithm better than alpha-beta?
- An Adaptive Sampling Algorithm for Solving Markov Decision Processes
- An analysis of alpha-beta pruning
- Asymptotic properties of minimax trees and game-searching procedures
- Best-first fixed-depth minimax algorithms
- Best-first minimax search
- Compressed pattern databases
- Computer Go
- Computer Go: An AI oriented survey
- Conspiracy numbers for min-max search
- Deep Blue
- Depth-first iterative-deepening: An optimal admissible tree search
- Dynamic control in real-time heuristic search
- Game tree searching by min/max approximation
- Games, computers, and artificial intelligence
- scientific article; zbMATH DE number 2243373 (Why is no real title available?)
- scientific article; zbMATH DE number 3063363 (Why is no real title available?)
- scientific article; zbMATH DE number 3106184 (Why is no real title available?)
- PROGRESSIVE STRATEGIES FOR MONTE-CARLO TREE SEARCH
- Proof-number search
- Simple statistical gradient-following algorithms for connectionist reinforcement learning
- Sokoban: Enhancing general single-agent search methods using domain knowledge
- Statecharts: a visual formalism for complex systems
- World-championship-caliber Scrabble*
This page was built for publication: Artificial intelligence for games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6602258)