Some methods of controlling the tree search in chess programs

DOI10.1016/0004-3702(75)90021-1zbMath0313.68069OpenAlexW2047008100MaRDI QIDQ1220395

V. L. Arlazarov, M. V. Donskoy, George M. Adelson-Velsky

Publication date: 1975

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0004-3702(75)90021-1

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Algorithms in computer science (68W99)

Related Items

Sokoban: Enhancing general single-agent search methods using domain knowledge ⋮ A chronology of computer chess and its literature ⋮ Strategies anticipating a difference in search depth using opponent-model search

Cites Work

• Unnamed Item
• Unnamed Item