Experiments With Some Programs That Search Game Trees

DOI10.1145/321510.321511MaRDI QIDQ5630563zbMATH OpenOpenAlexFDO

Authors John K. Dixon, James R. Slagle

Publication date 1969

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/321510.321511

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cited in

(22)

• A generalization of alpha-beta and SSS^* search procedures
• A Bayesian approach to relevance in game playing
• A minimax algorithm better than alpha-beta?
• Asymptotic properties of minimax trees and game-searching procedures
• An analysis of alpha-beta pruning
• The efficiency of the alpha-beta search on trees with branch-dependent terminal node scores
• Problem representations and formal properties of heuristic search
• On the branching factor of the alpha-beta pruning algorithm
• The multi-player version of minimax displays game-tree pathology
• Proof-number search
• Searching minimax game trees under memory space constraint
• Probabilistic opponent-model search
• Special issue: Heuristic search and computer game playing
• A comparison of minimax tree search algorithms
• Best-first minimax search
• An admissible and optimal algorithm for searching AND/OR graphs
• The technology chess program
• An algorithm to generate prime implicants and its application to the selection problem
• Applying the minimax rule over graphs which are not trees
• The \(PN^{*}\)-search algorithm: Application to tsume-shogi
• A world-championship-level Othello program
• Using Chunking to solve chess pawn endgames

This page was built for publication: Experiments With Some Programs That Search Game Trees

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