Re: Iterative Deepening

Article View: gnu.chess

Article #193

#193

From: Lloyd Lim
Date: Fri, 22 Jan 1993 07:34

23 lines
1576 bytes

In article <C15r40.D1r@sju.edu> tmoody@sju.edu (T. Moody) writes:
>
>My real problem is with (b).  Levy and Newborn say
>something about searching at a given level and storing lots of positions
>in a hash table before moving to the next level.  Is this the only way
>to do it?  I don't know a thing about hash tables and, from what I have
>read it looks like it's over my head.
>
>So my question is, can iterative deepening be usefully (if not
>optimally) accomplished without using hash tables?

Iterative deepening is commonly used with transposition (hash) tables,
but it doesn't require them.  Iterative deepening just means increasing
the search depth by one each time (i.e. - searching to a depth of 1,
then 2, then 3, ...).  You don't need to use transposition tables.
They are just used to speed things up, because many of the same nodes
are encountered again when you search to depth n+1.

+++
Lloyd Lim                    Internet: lim@cs.ucdavis.edu
Lim Unlimited                America Online: LimUnltd
330 W. Iris Ave.             AppleLink: LimUnltd
Stockton, CA  95210-3738     CompuServe: 72647,660

Technical Details

Message-ID: <21659@ucdavis.ucdavis.edu>

Path: arc1-ca.pugleaf.net!sparky!uunet!stanford.edu!agate!dog.ee.lbl.gov!ucbvax!ucdavis!toadflax!lim

References: <C15r40.D1r@sju.edu>

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!sparky!uunet!stanford.edu!agate!dog.ee.lbl.gov!ucbvax!ucdavis!toadflax!lim
From: lim@toadflax.cs.ucdavis.edu (Lloyd Lim)
Newsgroups: gnu.chess
Subject: Re: Iterative Deepening
Message-ID: <21659@ucdavis.ucdavis.edu>
Date: 22 Jan 93 07:34:07 GMT
References: <C15r40.D1r@sju.edu>
Sender: usenet@ucdavis.ucdavis.edu
Distribution: gnu
Organization: Department of Computer Science, University of California, Davis
Lines: 23

Reply to Parent Message