Two-agent IDA*

DOI10.1080/095281398146707zbMath1055.68533OpenAlexW2033161995MaRDI 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

zbMATH Keywords

search algorithmbranch-and-bound pruning

Mathematics Subject Classification ID

Searching and sorting (68P10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

Ultra-weak solutions and consistency enforcement in minimax weighted constraint satisfaction

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

This page was built for publication: Two-agent IDA*