Heuristics: intelligent search strategies for computer problem solving
Heuristics: intelligent search strategies for computer problem solving
Depth-first iterative-deepening: an optimal admissible tree search
Artificial Intelligence
Low overhead alternatives to SSS*
Artificial Intelligence
Multiprocessor tree-search experiments
Advances in computer chess
Presence and absence of pathology on game trees
Advances in computer chess
Generalization of alpha-beta SSS* search procedures
Artificial Intelligence
Parallel processing of combinatorial search
Proc. of an international workshop on Parallel algorithms and architectures
Game tree searching by min/max approximation
Artificial Intelligence
Conspiracy numbers for min-max search
Artificial Intelligence
Alpha-Beta search on virtual tree machines
Information Sciences: an International Journal - Parallel Processing/Part II
Unsynchronized Iteratively Deepening Parallel Alpha-Beta Search
IEEE Transactions on Pattern Analysis and Machine Intelligence
Accuracy and savings in depth-limited capture search
International Journal of Man-Machine Studies
A general branch-and-bound formulation for and/or graph and game tree search
Search in Artificial Intelligence
C3P Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2
The design and analysis of parallel algorithms
The design and analysis of parallel algorithms
Distributed game-tree searching
Journal of Parallel and Distributed Computing
Pattern knowledge and search: the SUPREM architecture
Artificial Intelligence
Control strategies for two-player games
ACM Computing Surveys (CSUR)
The History Heuristic and Alpha-Beta Search Enhancements in Practice
IEEE Transactions on Pattern Analysis and Machine Intelligence
On parallel evaluation of game trees
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Measuring the performance potential of chess programs
Artificial Intelligence - Special issue on computer chess
Reasoning with uncertainty in computer chess
Artificial Intelligence - Special issue on computer chess
An incremental negamax algorithm
Artificial Intelligence - Special issue on computer chess
Artificial Intelligence - Special issue on computer chess
Probability-based game tree pruning
Journal of Algorithms
Depth-limited search for real-time problem solving
Real-Time Systems
Parallel heuristic search: two approaches
Parallel algorithms for machine intelligence and vision
Parallel algorithms for machine intelligence and vision
Multi-player alpha-beta pruning
Artificial Intelligence
Single-Agent Parallel Window Search
IEEE Transactions on Pattern Analysis and Machine Intelligence
Minimax Search Algorithms With and Without Aspiration Windows
IEEE Transactions on Pattern Analysis and Machine Intelligence
A game tree with distinct leaf values which is easy for the alpha-beta algorithm
Artificial Intelligence
A general best first search algorithm in AND/OR graphs
Journal of Algorithms
A comparison of two paradigms for distributed shared memory
Software—Practice & Experience
A parallel game tree search algorithm with a linear speedup
Journal of Algorithms
Experiments With Some Programs That Search Game Trees
Journal of the ACM (JACM)
Optimal Search on Some Game Trees
Journal of the ACM (JACM)
ACM '86 Proceedings of 1986 ACM Fall joint computer conference
Parallel Search of Strongly Ordered Game Trees
ACM Computing Surveys (CSUR)
The solution for the branching factor of the alpha-beta pruning algorithm and its optimality
Communications of the ACM
Computers, Chess, and Cognition
Computers, Chess, and Cognition
Consistent Linear Speedup in Parallel Alpha-Beta Search
ICCI '92 Proceedings of the Fourth International Conference on Computing and Information: Computing and Information
Distributed Game Tree Search on a Massively Parallel System
Data Structures and Efficient Algorithms, Final Report on the DFG Special Joint Initiative
A comparison of some parallel game-tree search algorithms
A comparison of some parallel game-tree search algorithms
Large-scale parallelization of alpha-beta search: an algorithmic and architectural study with computer chess
| Hi-index | 0.00 |
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 BIBTEX 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 BIBTEX 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.