Transposition table driven work scheduling in distributed game-tree search

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2338, Issue , 2002, Pages 56-68

  Kishimoto, Akihiro ^a   Schaeffer, Jonathan ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

SCHEDULING; TREES (MATHEMATICS);

ALPHA-BETA; DISTRIBUTED GAMES; PARALLEL SEARCH ALGORITHM; SINGLE-AGENT; TRANSPOSITION TABLE; WORK SCHEDULING;

ARTIFICIAL INTELLIGENCE;

EID: 84974667654     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-47922-8_5     Document Type: Conference Paper

References (14)

1. Mark Brockington. A taxonomy of parallel game-tree search algorithms. International Computer Chess Association Journal, 19(3):162–174, 1996. 57.
2. Mark Brockington. Asynchronous Parallel Game-Tree Search. PhD thesis, Department of Computing Science, University of Alberta, 1998. 60, 61, 66.
3. T. Dean and M. Boddy. An analysis of time-dependent planning. In AAAI National Conference, pages 49–54, 1988. 56.
4. Rainer Feldmann. Game Tree Search on Massively Parallel Systems. PhD thesis, University of Paderborn, August 1993. 59.
5. Akihiro Kishimoto. Transposition Table Driven Scheduling for Two-Player Games. Master’s thesis, Department of Computing Science, University of Alberta, 2002. 57, 61.
6. Bradley Kuszmaul. Synchronized MIMD Computing. PhD thesis, Massachusetts Institute of Technology, 1994. 59.
7. Tony Marsland. Relative performance of alpha-beta implementations. In International Joint Conference on Artificial Intelligence, pages 763–766, 1983. 57.
8. Aske Plaat, Jonathan Schaeffer, Wim Pijls, and Arie de Bruin. Best-first fixed depth minimax algorithms. Artificial Intelligence, 87(1–2):1–38, 1996. 56.
9. John Romein. Multigame - An Environment for Distributed Game-Tree Search. PhD thesis, Vrije Universitat Amsterdam, 2001. 67.
10. John Romein, Henri Bal, Jonathan Schaeffer, and Aske Plaat. A performance analysis of transposition-table-driven scheduling. IEEE Transactions on Parallel and Distributed Systems, 2001. To appear. 56, 60.
11. John Romein, Aske Plaat, Henri Bal, and Jonathan Schaeffer. Transposition table driven work scheduling in distributed search. AAAI National Conference, pages 725–731, 1999. 56, 60.
12. Jonathan Schaeffer. Distributed game-tree searching. Journal of Parallel and Distributed Computing, 6:90–114, 1989. 60.
13. David Slate and Larry Atkin. CHESS 4.5 - The Northwestern University Chess Program. In Peter Frey, editor, Chess Skill in Man and Machine, pages 82–118. Springer-Verlag, 1977. 57.
14. J.-C. Weill. The ABDADA distributed minmax-search algorithm. International Computer Chess Association Journal, 19(1):3–16, 1996. 59, 60, 67