Author: Robert Hyatt
Date: 20:11:48 05/19/04
Go up one level in this thread
On May 19, 2004 at 23:07:20, James Swafford 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.
>
>
>What you describe is called "Depth First Search With Iterative Deepening"
>by George Luger in his text "Artificial Intelligence: Structures
>and Strategies for Complex Problem Solving", pg. 106.
>
>Note he still calls it "Depth First", but adds the qualifier.
>
>You wouldn't argue semantics with Luger, would you?
>
>--
>James
He would argue semantics with _anyone_ that disagrees with him.
I don't even know how we got off onto depth-first stuff. Apparently in the copy
of my dissertation that he claims to not be able to obtain, he saw the term
"depth-first search" and decided to claim that my parallel search was not the
same kind of search we use today. Where that comes from is beyond me, but
that's a different angle.
Basically he just makes crap up, posts it as thought it is a etched-in-stone
fact (when it is not) and then uses that "crap" to "proof" somethingoranother.
really a hopeless person to deal with...
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.