Parallel searches of game trees

Hiromoto Usui, Masafumi Yamashita, Masaharu Imai, Toshihide Ibaraki

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

A two‐person perfect‐information game is represented by a minimax game tree and, by solving the tree, we can obtain the result of the game when both players choose perfect moves at all the positions. To this end, various search procedures have been proposed. In this paper, these procedures are modified to implement them on a parallel computer consisting of m processors, and variations of the computation time are investigated with m being a parameter. As a theoretical result, we point out that the speedup ratio of the computation time of solving a game tree by m processors to that by 1 processor may become larger than m (acceleration anomaly) or smaller than 1 (detrimental anomaly) in general. Also, we show that the detrimental anomaly does not occur as long as the five search procedures investigated in this paper are used. Next, through simulation experiments, it is shown that the speedup ratio is considerably smaller than m, and its cause is discussed. The eligible search is considered to be the best among the search procedure investigated.

Original languageEnglish
Pages (from-to)97-109
Number of pages13
JournalSystems and Computers in Japan
Volume18
Issue number8
DOIs
Publication statusPublished - Jan 1 1987

Fingerprint

Game
Anomaly
Speedup
Parallel Computers
Minimax
Simulation Experiment
Choose
Experiments

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Information Systems
  • Hardware and Architecture
  • Computational Theory and Mathematics

Cite this

Usui, H., Yamashita, M., Imai, M., & Ibaraki, T. (1987). Parallel searches of game trees. Systems and Computers in Japan, 18(8), 97-109. https://doi.org/10.1002/scj.4690180810

Parallel searches of game trees. / Usui, Hiromoto; Yamashita, Masafumi; Imai, Masaharu; Ibaraki, Toshihide.

In: Systems and Computers in Japan, Vol. 18, No. 8, 01.01.1987, p. 97-109.

Research output: Contribution to journalArticle

Usui, H, Yamashita, M, Imai, M & Ibaraki, T 1987, 'Parallel searches of game trees', Systems and Computers in Japan, vol. 18, no. 8, pp. 97-109. https://doi.org/10.1002/scj.4690180810
Usui H, Yamashita M, Imai M, Ibaraki T. Parallel searches of game trees. Systems and Computers in Japan. 1987 Jan 1;18(8):97-109. https://doi.org/10.1002/scj.4690180810
Usui, Hiromoto ; Yamashita, Masafumi ; Imai, Masaharu ; Ibaraki, Toshihide. / Parallel searches of game trees. In: Systems and Computers in Japan. 1987 ; Vol. 18, No. 8. pp. 97-109.
@article{9c52dad8765440e1a05d5f32fd59bf00,
title = "Parallel searches of game trees",
abstract = "A two‐person perfect‐information game is represented by a minimax game tree and, by solving the tree, we can obtain the result of the game when both players choose perfect moves at all the positions. To this end, various search procedures have been proposed. In this paper, these procedures are modified to implement them on a parallel computer consisting of m processors, and variations of the computation time are investigated with m being a parameter. As a theoretical result, we point out that the speedup ratio of the computation time of solving a game tree by m processors to that by 1 processor may become larger than m (acceleration anomaly) or smaller than 1 (detrimental anomaly) in general. Also, we show that the detrimental anomaly does not occur as long as the five search procedures investigated in this paper are used. Next, through simulation experiments, it is shown that the speedup ratio is considerably smaller than m, and its cause is discussed. The eligible search is considered to be the best among the search procedure investigated.",
author = "Hiromoto Usui and Masafumi Yamashita and Masaharu Imai and Toshihide Ibaraki",
year = "1987",
month = "1",
day = "1",
doi = "10.1002/scj.4690180810",
language = "English",
volume = "18",
pages = "97--109",
journal = "Systems and Computers in Japan",
issn = "0882-1666",
publisher = "John Wiley and Sons Inc.",
number = "8",

}

TY - JOUR

T1 - Parallel searches of game trees

AU - Usui, Hiromoto

AU - Yamashita, Masafumi

AU - Imai, Masaharu

AU - Ibaraki, Toshihide

PY - 1987/1/1

Y1 - 1987/1/1

N2 - A two‐person perfect‐information game is represented by a minimax game tree and, by solving the tree, we can obtain the result of the game when both players choose perfect moves at all the positions. To this end, various search procedures have been proposed. In this paper, these procedures are modified to implement them on a parallel computer consisting of m processors, and variations of the computation time are investigated with m being a parameter. As a theoretical result, we point out that the speedup ratio of the computation time of solving a game tree by m processors to that by 1 processor may become larger than m (acceleration anomaly) or smaller than 1 (detrimental anomaly) in general. Also, we show that the detrimental anomaly does not occur as long as the five search procedures investigated in this paper are used. Next, through simulation experiments, it is shown that the speedup ratio is considerably smaller than m, and its cause is discussed. The eligible search is considered to be the best among the search procedure investigated.

AB - A two‐person perfect‐information game is represented by a minimax game tree and, by solving the tree, we can obtain the result of the game when both players choose perfect moves at all the positions. To this end, various search procedures have been proposed. In this paper, these procedures are modified to implement them on a parallel computer consisting of m processors, and variations of the computation time are investigated with m being a parameter. As a theoretical result, we point out that the speedup ratio of the computation time of solving a game tree by m processors to that by 1 processor may become larger than m (acceleration anomaly) or smaller than 1 (detrimental anomaly) in general. Also, we show that the detrimental anomaly does not occur as long as the five search procedures investigated in this paper are used. Next, through simulation experiments, it is shown that the speedup ratio is considerably smaller than m, and its cause is discussed. The eligible search is considered to be the best among the search procedure investigated.

UR - http://www.scopus.com/inward/record.url?scp=0023504136&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0023504136&partnerID=8YFLogxK

U2 - 10.1002/scj.4690180810

DO - 10.1002/scj.4690180810

M3 - Article

AN - SCOPUS:0023504136

VL - 18

SP - 97

EP - 109

JO - Systems and Computers in Japan

JF - Systems and Computers in Japan

SN - 0882-1666

IS - 8

ER -