Massively parallel implementation of a pattern based evaluation function for computer chess
A considerable amount of research has been carried out on efficient algorithms for computer chess on both the single instruction multiple data (SIMD) and multiple instruction multiple data (MIMD) machines. However, much of these algorithms have been written for the game tree search process rather th...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | English |
| Published: |
2008
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10356/13312 |