L
Título: An analysis of speculative search for asynchronous parallel alpha-beta search /
Autores: Waldorf, Mahlon R.
Fecha: 2000
Publicador: McGill University
Fuente: Ver documento
Tipo: Electronic Thesis or Dissertation
Tema: Computer Science.
Descripción: In the area of computer game playing, much effort has been spent to increase the efficiency of game-tree search. Parallel alphabeta game tree search is a powerful tool in this endeavor. Most parallel alphabeta algorithms involve some form of synchronization of processors during a search, generally resulting in a waste of time. Some algorithms, however, such as APHID, are asynchronous, with all processors working essentially independently during a search.
Asynchronous algorithms are not necessarily limited to a search horizon in the way that synchronous algorithms are. Search beyond this horizon has been called speculative search. A series of experiments were conducted to determine how much value information from speculative search contributes to the overall search. Compared to a synchronized parallel alphabeta search, speculative search was found to contribute to the principle variation score up to 60% of the time and results in a different move selection up to 25% of the time on a nine processor network.
Idioma: en