The Variance of Two Game Tree Algorithms

DOI10.1006/JAGM.1998.0928zbMATH Open0919.68095OpenAlexW1998033597MaRDI QIDQ4216144FDOQ4216144

Authors: Yanjun Zhang 

Publication date: 23 August 1999

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jagm.1998.0928

Recommendations

• The Complexity of Algorithms Computing Game Trees on Random Assignments
• The Computational Complexity of Game Trees by Eigen-Distribution
• scientific article
• Fast algorithms for finding randomized strategies in game trees
• scientific article; zbMATH DE number 3900780
• The eigen-distribution of weighted game trees
• Asymptotic Properties of Minimax Trees and Game-Searching Procedures
• The variance of the height of binary search trees
• The effect of mobility on minimaxing of game trees with random leaf values
• scientific article; zbMATH DE number 269837

zbMATH Keywords

game tree algorithmsSCOUT algorithm

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cited In (4)

• Eigen-distribution on random assignments for game trees
• The Computational Complexity of Game Trees by Eigen-Distribution
• Title not available (Why is that?)
• The eigen-distribution of weighted game trees

This page was built for publication: The Variance of Two Game Tree Algorithms

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