Sciweavers

Share
ACG
2015
Springer

Feature Strength and Parallelization of Sibling Conspiracy Number Search

4 years 11 months ago
Feature Strength and Parallelization of Sibling Conspiracy Number Search
Abstract. Recently we introduced Sibling Conspiracy Number Search — an algorithm based not on evaluation of leaf states of the search tree but, for each node, on relative evaluation scores of all children of that node — and implemented an SCNS Hex bot. Here we show the strength of SCNS features: most critical is to initialize leaves via a multi-step process. Also, we show a simple parallel version of SCNS: it scales well for 2 threads but less efficiently for 4 or 8 threads. Advances in Computers and Games 2015, Plaat et al. (eds), Springer LNCS (to appear)
Jakub Pawlewicz, Ryan B. Hayward
Added 28 Mar 2016
Updated 28 Mar 2016
Type Journal
Year 2015
Where ACG
Authors Jakub Pawlewicz, Ryan B. Hayward
Comments (0)
books