Author: James Swafford
Date: 06:34:32 05/20/04
Go up one level in this thread
On May 20, 2004 at 08:41:39, Vincent Diepeveen wrote:
>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?
>
>He has it wrong then.
>
>Even the deep blue team calls it depth limited in their articles.
>
>In fact it is even more breath first search than depth first search in fact.
>
>You first search all siblings before moving onto the deep.
>
>But it definitely is depth limited.
I think it's obvious that Luger knows what he's talking about,
and I think it's obvious you know what the search does, as does
Hyatt. It does a (bounded) DFS at each iteration, so Luger's
term sounds like it's right on to me.
What are you trying to accomplish here?
--
James
>
>>--
>>James
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.