A Bayesian approach to relevance in game playing
- 31 December 1997
- journal article
- Published by Elsevier in Artificial Intelligence
- Vol. 97 (1-2) , 195-242
- https://doi.org/10.1016/s0004-3702(97)00059-3
Abstract
No abstract availableKeywords
This publication has 29 references indexed in Scilit:
- Best-first minimax searchArtificial Intelligence, 1996
- Singular extensions: Adding selectivity to brute-force searchingArtificial Intelligence, 1990
- A generalised quiescence search algorithmArtificial Intelligence, 1990
- Conspiracy numbersArtificial Intelligence, 1990
- The development of a world class Othello programArtificial Intelligence, 1990
- Monte-Carlo approximation algorithms for enumeration problemsJournal of Algorithms, 1989
- Pathology on game trees revisited, and an alternative to minimaxingArtificial Intelligence, 1983
- A world-championship-level Othello programArtificial Intelligence, 1982
- The B∗ tree search algorithm—New resultsArtificial Intelligence, 1982
- Expected time bounds for selectionCommunications of the ACM, 1975