A general framework for minimax search in game trees

DOI10.1016/0020-0190(94)00166-9zbMath0938.68924OpenAlexW2075268440MaRDI QIDQ1342257

Subir Bhattacharya, Amitava Bagchi

Publication date: 21 June 2000

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(94)00166-9

zbMATH Keywords

design of algorithmsdepth-first searchbest-first search

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05)

Cites Work

• A faster alternative to \(SSS^*\) with extension to variable memory
• A generalization of alpha-beta and \(SSS^*\) search procedures
• A minimax algorithm better than alpha-beta?
• An analysis of alpha-beta pruning