Abstract
This article lists all theoretical and practical papers, theses and reports known to the author on the subject of studying minimax trees and analyzing sequential and parallel minimax tree search algorithms.The items of the bibliography are listed in alphabetical order in accordance with the first author's name. Items not marked are in my collection or are available to me (if there are any hard-to-obtain items in this group, I would be happy to make copies of them available). Others, e.g. items marked with a star (*), are cited elsewhere as relevant, but are yet unavailable to me (I would appreciate receiving copies of these from anyone who has access to them).This bibliography is available in computer readable BIBT
E
X form by sending an e-mail request to the author or by anonymous ftp from valkyries.andrew.cmu.edu in directory /pub/chess/texts. The labels indicated are they keys used in the BIBT
E
X version of the bibliography. Any corrections as well as new items to this bibliography are kindly requested and highly appreciated in advance. Finally the author wishes to thank all the people who have helped in building this bibliography.
Publisher
Association for Computing Machinery (ACM)
Reference113 articles.
1. Control strategies for two-player games
2. com.atypon.pdfplus.internal.model.plusxml.impl.AuthorGroup@462ff48a
Searching game trees in parallel. Technical report Queen's University Department of Computing and Information Science November 1979. [Akl79] SELIM G. AKL DAVID T. BARNARD AND RALPH J. DORAN. Searching game trees in parallel. Technical report Queen's University Department of Computing and Information Science November 1979.
3. IEEE Transactions on Pattern Analysis and Machine Intelligence PAMI-4(2) 1982 192-203 and implementation of a parallel tree search algorithm
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献