|
Computer chess has, over the years, served as a metric for showing the progress of computer science. It was a momentous occasion when IBM's Deep Blue was able to defeat world champion Garry Kasparov. Many hardware based chess computers have been developed; however in an age of multi-core it will be expected that the progress will continue to advance despite the end of the free lunch given by Moore's Law. We present methods involved in parallelizing a chess engine. We then present a discussion of our implementation of such an engine. |