Author: Uri Blass
Date: 05:12:55 09/03/03
Go up one level in this thread
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. If you want to change something in the search rules then you need to change your program in a lot of places. I guess that you need to write code for every possible depth that you get and in order to let your self to do extensions you need to write code for depth 10,depth 10 after one extension,depth 10 after 2 extensions, and you also need to limit the number of extensions at specific depth. You also limit your possibilities to extend because you cannot decide to extend more than one ply without modifying your code. <snipped> > >Diep's parallel performance does seem to be better than what you and I are >getting. I have no idea about Diep's parallel performance. I do not know about a single game of Diep on the new machine and I guess that we need to wait for november to see its performance. Uri
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.