Author: Gian-Carlo Pascutto
Date: 05:24:09 09/03/03
Go up one level in this thread
On September 03, 2003 at 08:12:55, Uri Blass wrote: >On September 03, 2003 at 02:24:00, Gian-Carlo Pascutto wrote: > >>On September 02, 2003 at 22:34:49, Robert Hyatt wrote: >> >>>>Been working a year fulltime now :) >>>> >>> >>>So? It took you over a year to get your parallel search working. It took >>>me weeks. >>> >>>:) >> >>In all fairness, he did a full DTS implementation, including rewriting the >>program to a nonrecursive search, while you took an easy way out. > >I do not understand the need for non recursive search. > >I think that non recursive search simply limit your possibilities for future >developement because the code is ugly and you need to write almost the same >function again and again. Uh, no. Not using recursive search doesn't mean you have write the search function a hundred times all over again! Try looking at examples of recursive vs nonrecursive quicksort on the web if you don't understand how that can be done. DTS was designed to work with a nonrecursive search because it allows making splitpoints when needed higher up in the tree than the point where you are at the moment you notice you need to split. -- GCP
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.