Abstract
This paper presents a new method to parallelize the mmunax tree-search algorithm. This method is then compared to the Young-Brothers-Wait-Concept algorithm in two implementations: Othello and Chess. Results of tests on a 32-node CMS are given.
Get full access to this article
View all access options for this article.