Game tree algorithms and solution trees

DOI10.1016/S0304-3975(00)00082-7zbMATH Open0954.68116OpenAlexW1964867441MaRDI QIDQ1589517FDOQ1589517

Authors: Wim Pijls, Arie de Bruin 

Publication date: 12 December 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00082-7

Recommendations

• Publication:3489505
• Optimal Search on Some Game Trees
• scientific article; zbMATH DE number 895355
• scientific article; zbMATH DE number 42543
• A general framework for minimax search in game trees

zbMATH Keywords

minimax searchalphabetaMTDsolution treesSSS*tame tree search

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Cites Work

• An analysis of alpha-beta pruning
• A minimax algorithm better than alpha-beta?
• A general branch and bound formulation for understanding and synthesizing And/Or tree search procedures
• A generalization of alpha-beta and \(SSS^*\) search procedures
• A minimax algorithm better than alpha-beta? Yes and no
• Parallelism in alpha-beta search
• Artificial intelligence in perspective: a retrospective on fifty volumes of the Artificial Intelligence journal

Cited In (10)

• Best-first fixed-depth minimax algorithms
• Title not available (Why is that?)
• On solving the 7,7,5-game and the 8,8,5-game
• Game tree searching by min/max approximation
• Title not available (Why is that?)
• On the complexity of searching game trees and other recursion trees
• The tree search game for two players
• Solving multistage quantified linear optimization problems with the alpha-beta nested Benders decomposition
• Searching game trees under a partial order
• A Dynamic Algorithm for Reachability Games Played on Trees

This page was built for publication: Game tree algorithms and solution trees

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