Author: Dann Corbit
Date: 16:07:12 10/25/02
Go up one level in this thread
On October 25, 2002 at 17:35:21, Omid David wrote: [snip] >Sivan Toledo lectured on this article (which is a ranzomized version of Korf and >Chickering's BFS), in the Haifa computer chess symposium. It's an interesting >paper, but my impression is that it is completely impractical. Well, he does some very odd things in the search. But he got a linear speedup. If you threw 10,000 CPUs at it, it could well be the fastest thing on the planet. I think the basic idea deserves some attention (though his not searching bad replies has got to go).
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.