Two-agent IDA*
From MaRDI portal
Publication:4421276
DOI10.1080/095281398146707zbMath1055.68533MaRDI QIDQ4421276
Armand E. Prieditis, Evan Fletcher
Publication date: 1998
Published in: Journal of Experimental & Theoretical Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/095281398146707
68P10: Searching and sorting
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Depth-first iterative-deepening: An optimal admissible tree search
- Game tree searching by min/max approximation
- Conspiracy numbers for min-max search
- A minimax algorithm better than alpha-beta?
- An analysis of alpha-beta pruning
- Practical issues in temporal difference learning
- Pathology on game trees revisited, and an alternative to minimaxing
- A comparison of minimax tree search algorithms
- Real-time heuristic search
- Qubic: 4 × 4 × 4 Tic-Tac-Toe