Author: Robert Hyatt
Date: 20:03:14 05/19/04
Go up one level in this thread
On May 19, 2004 at 22:52:34, Vincent Diepeveen wrote:
>On May 19, 2004 at 22:49:05, Christophe Theron wrote:
>
>>On May 19, 2004 at 22:28:50, Vincent Diepeveen wrote:
>>
>>>main() {
>>> search(10); // search 10 ply depthfirst
>>>
>>> for i = 1 to 10 // depth limited 1..10 ply search
>>> search(i);
>>>}
>>>
>>>search(int depth) {
>>> if depth == 0
>>> then return eval();
>>> else for all moves
>>> search(depth-1);
>>>}
>>>
>>>Robert Morgan Hyatt doesn't seem to understand this in his thesis.
>>
>>
>>
>>Your code does not compile. Can you help?
>
>Perhaps R.M. Hyatt has a compilable version of Cray Blitz for you to illustrate?
Just look at search.c in Crafty. It is a classic implementation of depth-first
search.
BTW a simple google search will show you that "depth-limited search" is simply a
special case of depth-first search. But you already knew that. You just wanted
to produce one more lie...
The depth-first search used in Cray Blitz is _exactly_ the same depth-first
search used in Crafty, right down to the fractional plies. The main two
differences are no SE in Crafty, and no recursive null-move in Cray Blitz, with
R=1 everywhere. In all other respects the searches are _identical_.
Wiggle out of _this_ screwup now, Vincent...
>
>>
>>
>> Christophe
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.