Path: utzoo!attcan!uunet!husc6!mailrus!eecae!netnews.upenn.edu!linc.cis.upenn.edu!hannan
From: hannan@linc.cis.upenn.edu (John Hannan)
Newsgroups: comp.ai
Subject: Re: "Iterative Deepening" reference wanted
Message-ID: <6207@netnews.upenn.edu>
Date: 16 Nov 88 16:15:51 GMT
References: <688@quintus.UUCP>
Sender: news@netnews.upenn.edu
Reply-To: hannan@linc.cis.upenn.edu.UUCP (John Hannan)
Organization: University of Pennsylvania
Lines: 13

In article <688@quintus.UUCP> ok@quintus () writes:
>In my Prolog tutorial, I described a search method intermediate between
>depth first and breadth first, called
>	Iterative Deepening
>or	Consecutively Bounded Depth-First Search
>
>Does anyone know who invented these terms,

Check out "Depth-First Iterative Deepening: An Optimal Admissible Tree
Search," by R. Korf in AI Journal 27(1):97-109 and also a related
article by Korf in IJCAI85 proceedings.  In the intro to his journal
paper, Korf briefly describes the origin of the algorithm but he seems to
have been the first person to use this term.