Solving the Game of Awari using Parallel Retrograde Analysis

J.W. Romein, H.E. Bal

Research output: Contribution to JournalArticleAcademicpeer-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 languageEnglish
Pages (from-to)26-33
JournalComputer
Volume38
Issue number10
DOIs
Publication statusPublished - 2003

Bibliographical note

Romein:2003

Fingerprint Dive into the research topics of 'Solving the Game of Awari using Parallel Retrograde Analysis'. Together they form a unique fingerprint.

Cite this