Using aspiration windows for minimax algorithms

Authors:
Reza Shams;Hermann Kaindl;Helmut Horacek
Affiliations:
Alcatel-ELIN, Wien, Austria;SIEMENS AG Osterreich, Wien, Austria;Universitat Bielefeld, Bielefeld, Germany
Venue:
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Year:
1991

Citing 6
Cited 1

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
Experiments in search and knowledge

Experiments in search and knowledge
Low overhead alternatives to SSS*

Artificial Intelligence
The History Heuristic and Alpha-Beta Search Enhancements in Practice

IEEE Transactions on Pattern Analysis and Machine Intelligence
Parallel Search of Strongly Ordered Game Trees

ACM Computing Surveys (CSUR)

A Draughts Learning System Based on Neural Networks and Temporal Differences: The Impact of an Efficient Tree-Search Algorithm

SBIA '08 Proceedings of the 19th Brazilian Symposium on Artificial Intelligence: Advances in Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper investigates the effects of parallelism on blackboard system scheduling. A parallel blackboard system is described that allows multiple knowledge source instantiations to execute in parallel using a shared-memory blackboard approach. New classes ...