Solving the Game of Awari using Parallel Retrograde Analysis

J.W. Romein; H.E. Bal

doi:10.1109/MC.2003.1236468

Solving the Game of Awari using Parallel Retrograde Analysis

J.W. Romein, H.E. Bal

Research output: Contribution to Journal › Article › Academic › peer-review

Abstract

A new parallel search algorithm running on a large computer cluster solves a popular board game by efficiently computing the best moves from all reachable positions. As such, the algorithm uses the main memories for frequently and randomly accessed data and stores terbytes of less frequently acessed intermediate results on disks. All processors repeatably inform each other about positions' intermediate values, generating more than a petabit of interprocessor communication as well as terabytes of disk I/O.

Original language	English
Pages (from-to)	26-33
Journal	Computer
Volume	38
Issue number	10
DOIs	https://doi.org/10.1109/MC.2003.1236468
Publication status	Published - 2003

Bibliographical note

Romein:2003

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

Access to Document

10.1109/MC.2003.1236468

Handle.net

Persistent link

Cite this

@article{f6424a6b69cc48e6a2b0d0591d5552ca,

title = "Solving the Game of Awari using Parallel Retrograde Analysis",

abstract = "A new parallel search algorithm running on a large computer cluster solves a popular board game by efficiently computing the best moves from all reachable positions. As such, the algorithm uses the main memories for frequently and randomly accessed data and stores terbytes of less frequently acessed intermediate results on disks. All processors repeatably inform each other about positions' intermediate values, generating more than a petabit of interprocessor communication as well as terabytes of disk I/O.",

author = "J.W. Romein and H.E. Bal",

note = "Romein:2003 ",

year = "2003",

doi = "10.1109/MC.2003.1236468",

language = "English",

volume = "38",

pages = "26--33",

journal = "Computer",

issn = "0018-9162",

publisher = "IEEE",

number = "10",

}

TY - JOUR

T1 - Solving the Game of Awari using Parallel Retrograde Analysis

AU - Romein, J.W.

AU - Bal, H.E.

N1 - Romein:2003

PY - 2003

Y1 - 2003

N2 - A new parallel search algorithm running on a large computer cluster solves a popular board game by efficiently computing the best moves from all reachable positions. As such, the algorithm uses the main memories for frequently and randomly accessed data and stores terbytes of less frequently acessed intermediate results on disks. All processors repeatably inform each other about positions' intermediate values, generating more than a petabit of interprocessor communication as well as terabytes of disk I/O.

AB - A new parallel search algorithm running on a large computer cluster solves a popular board game by efficiently computing the best moves from all reachable positions. As such, the algorithm uses the main memories for frequently and randomly accessed data and stores terbytes of less frequently acessed intermediate results on disks. All processors repeatably inform each other about positions' intermediate values, generating more than a petabit of interprocessor communication as well as terabytes of disk I/O.

U2 - 10.1109/MC.2003.1236468

DO - 10.1109/MC.2003.1236468

M3 - Article

SN - 0018-9162

VL - 38

SP - 26

EP - 33

JO - Computer

JF - Computer

IS - 10

ER -

Solving the Game of Awari using Parallel Retrograde Analysis

Abstract

Bibliographical note

UN SDGs

Access to Document

Handle.net

Fingerprint

Cite this