Author: Les Fernandez
Date: 19:05:29 10/25/02
Go up one level in this thread
On October 25, 2002 at 17:35:21, Omid David wrote: >On October 25, 2002 at 15:35:22, Paul wrote: > >>On October 25, 2002 at 13:21:25, Les Fernandez wrote: >> >>>A few months ago someone here provided a link to a RBF algoritm paper that was >>>about 38 ? pages in length. I tried looking through the archives but it seems >>>as though it will take a long time to find it since it requires unzipping for >>>every date. Does anyone remember this and can tell me the date of the thread?? >>>I believe Vincent also made comments regarding it as well as a few others. >>> >>>Thanks, >>> >>>Les >> >>Start of thread was 10th of September 2002 (9/10/02), time 23:56:26, post >>251524, subject 'Parallel search article RBF' by Dann Corbit ... >> >>link: http://www.math.tau.ac.il/~ysh/RBF.pdf > >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. Initially it may sound impractical but as we all have seen through careful thought and creativity there is always someone out there to take advantage of new concepts. Just my $.02 > >> >>Hope this is what you meant, >>Paul
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.