Recently we introduced Sibling Conspiracy Number Search — an al- gorithm based not on evaluation of leaf states of the search tree but, for e ach 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 vers ion of SCNS: it scales well for 2 threads but less efficiently for 4 or 8 thread s. Advances in Computers and Games 2015, Plaat et al. (eds), Spr inger LNCS (to appear)
['Jakub Pawlewicz', 'Ryan B. Hayward']
Feature Strength and Parallelization of Sibling Conspiracy Number Search