Two-agent IDA*

DOI10.1080/095281398146707MaRDI QIDQ4421276zbMATH OpenOpenAlexFDO

Authors 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

branch-and-bound pruningsearch algorithm

Mathematics Subject Classification ID

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

Recommendations

• Multi-player alpha-beta pruning
• Best-first minimax search
• Best-first fixed-depth minimax algorithms
• Depth-first iterative-deepening: An optimal admissible tree search
• Multi-cut -pruning in game-tree search

Cites work

• A comparison of minimax tree search algorithms
• A minimax algorithm better than alpha-beta?
• An analysis of alpha-beta pruning
• Conspiracy numbers for min-max search
• Depth-first iterative-deepening: An optimal admissible tree search
• Game tree searching by min/max approximation
• scientific article; zbMATH DE number 4162295 (Why is no real title available?)
• scientific article; zbMATH DE number 3657150 (Why is no real title available?)
• scientific article; zbMATH DE number 3559037 (Why is no real title available?)
• scientific article; zbMATH DE number 783783 (Why is no real title available?)
• Pathology on game trees revisited, and an alternative to minimaxing
• Practical issues in temporal difference learning
• Qubic: 4 × 4 × 4 Tic-Tac-Toe
• Real-time heuristic search

Cited in

(2)

• Unifying single-agent and two-player search
• Ultra-weak solutions and consistency enforcement in minimax weighted constraint satisfaction

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4421276)