A faster alternative to \(SSS^*\) with extension to variable memory

DOI10.1016/0020-0190(93)90034-7zbMath0778.68036OpenAlexW2060800509MaRDI QIDQ689627

Subir Bhattacharya, Amitava Bagchi

Publication date: 15 November 1993

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

Full work available at URL: https://doi.org/10.1016/0020-0190(93)90034-7

zbMATH Keywords

game tree searchminimax searchAlpha-Beta

Mathematics Subject Classification ID

2-person games (91A05) Games involving graphs (91A43) Parallel algorithms in computer science (68W10) Data structures (68P05)

Related Items

A general framework for minimax search in game trees ⋮ Best-first fixed-depth minimax algorithms

Cites Work

• Unnamed Item
• A minimax algorithm better than alpha-beta?
• An analysis of alpha-beta pruning