Author: Andreas Herrmann
Date: 17:34:52 06/10/03
Go up one level in this thread
On June 10, 2003 at 20:23:19, Omid David Tabibi wrote: >On June 10, 2003 at 19:51:34, Andreas Herrmann wrote: > >>Hi, >> >>at first i'm seraching for the following paper: >>Korf, R.E. (1985). Iterative deepening: An optimal admissible tree search. >>Artificial Intelligence, Vol. 27, No. 1, pp. 97-109. >> >>Is that somewhere available in the internet? Or can someone send it me by email? >>I'm also looking for similar papers. > >You can directly email Richard Korf (korf@cs.ucla.edu) regarding the paper. He >doesn't have any digital version of the old papers, but can send them to you by >snail-mail. thanks for the hint. I will try it. Andreas > > >> >> >>To the theme "Singular Extensions" i have found a paper named "VARIABLE SEARCH >>DEPTH" by T.A.Marsland. Are there better or similar papers available? >> >> >>Andreas
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.