The Realization of the Parallel Computer Chess Application

This paper is concerned with the realization of the parallel computer chess application. The asynchronous parallel search algorithm uses distributed local network. The original solution is implemented and tested in author´s chess application Axon. The standard approaches of parallelism use dual and quad server PC machine, which is expensive and rare compared with classical single processor PC machines. The author´s solution introduces a new class of simple and efficient algorithm of the parallelization, using standard single processor units connected via local 100 Mb or 1 Gbit networks. Compared with single processor search algorithms, the parallel algorithm significantly increases performance in test suites and practical play