Path: utzoo!attcan!uunet!ncrlnk!ncr-sd!hp-sdd!hplabs!ucbvax!bloom-beacon!argentine.ICS.UCI.EDU!baxter
From: baxter@argentine.ICS.UCI.EDU (Ira Baxter)
Newsgroups: comp.ai.digest
Subject: Re: "Iterative Deeping" reference wanted
Message-ID: <8812061745.aa08607@PARIS.ICS.UCI.EDU>
Date: 7 Dec 88 01:45:08 GMT
Sender: daemon@bloom-beacon.MIT.EDU
Organization: The Internet
Lines: 11
Approved: ailist@ai.ai.mit.edu


The earliest reference I found on iterative deepening is in
J. J. Scott, "A Chess Playing Program", Machine Intelligence 4,
1969, p. 255.  I initially didn't recognize it until I had
formulated a procedure I call "Recursive Iterative Deepening",
described in an unpublished paper of mine called "Variations on
Iterative Deepening Tree Search" (ASE project, University of
California at Irvine, 1986).

IDB
(714) 856-6693  ICS Dept/ UC Irvine, Irvine CA 92717