Special issue: Heuristic search and computer game playing

DOI10.1016/S0020-0255(01)00133-5zbMath0991.00018OpenAlexW2052549760MaRDI QIDQ1608365

No author found.

Publication date: 14 August 2002

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0255(01)00133-5

zbMATH Keywords

Special issueHeuristic searchComputer game playing

Mathematics Subject Classification ID

Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Proceedings, conferences, collections, etc. pertaining to game theory, economics, and finance (91-06)

Cites Work

• The *-minimax search procedure for trees containing chance nodes
• Pruning algorithms for multi-model adversary search
• An analysis of alpha-beta pruning
• The efficiency of the alpha-beta search on trees with branch-dependent terminal node scores
• Experiments with the M & N tree-searching program
• Experiments With Some Programs That Search Game Trees
• Unnamed Item
• Unnamed Item

This page was built for publication: Special issue: Heuristic search and computer game playing