News for hackers. Stuff that matters.
Re:Interview with Robert Houdart, author of the world's stro... by sethrin on Wednesday October 31, 2012 @08:27PM (#4725559)
The world of chess engines is the world of search algorithms. I've read that exploring a search tree is inherently serial, and while there have been large performance increases over the years (Houdini and other top engines are 3000+ ELO), it seems they have not substantially outstripped the single-threaded performance of modern CPUs.

There is a chess programming wiki[0] (which was possibly referred to in the article) which gives some examples of parallel search algorithms. There is also a chess engine written in openCL which is not terribly strong as yet. Those of you with greater knowledge of algorithms may find these problems interesting; if I had a dedicated GPU to hand I'd probably be hacking on it.

[0]http://chessprogramming.wikispaces.com/Parallel+Search [1]http://zeta-chess.blogspot.com/

There are no comments on this comment yet.