Article View: gnu.chess
Article #198Re: Iterative Deepening (The true story)
From: Roland Karlsson
Date: Mon, 25 Jan 1993 20:48
Date: Mon, 25 Jan 1993 20:48
18 lines
1332 bytes
1332 bytes
The original reason for iterative deepening was to speed up alpha-beta pruning. The pruning is most efficient when the moves to try is sorted best first. One way of approximize this is to first search a few plies, sort the result best move first, and then search deeper. Iterative deepening also makes it easier to play according to a chess clock. Stopping a deep search, without having the result from a more shallow one is a catastrophe. Transposition tables and iterative deepening is two different methods to improve chess playing. But both can be used without the other. -- Roland Karlsson SICS, PO Box 1263, S-164 28 KISTA, SWEDEN Internet: roland@sics.se Tel: +46 8 752 15 40 Fax: +46 8 751 72 30 Telex: 812 6154 7011 SICS Ttx: 2401-812 6154 7011=SICS
Technical Details
Message-ID:
<ROLAND.93Jan25214858@bugs.sics.se>Path:
arc1-ca.pugleaf.net!sparky!uunet!mcsun!sunic!sics.se!rolandReferences:
<C15r40.D1r@sju.edu> <21659@ucdavis.ucdavis.edu> <JON.93Jan25110340@cas.org>Show Full Headers
Complete Article Headers
Newsgroups: gnu.chess Path: arc1-ca.pugleaf.net!sparky!uunet!mcsun!sunic!sics.se!roland From: roland@sics.se (Roland Karlsson) Subject: Re: Iterative Deepening (The true story) In-Reply-To: jon@cas.org's message of Mon, 25 Jan 1993 16:03:40 GMT Message-ID: <ROLAND.93Jan25214858@bugs.sics.se> Sender: news@sics.se Organization: Swedish Institute of Computer Science, Kista References: <C15r40.D1r@sju.edu> <21659@ucdavis.ucdavis.edu> <JON.93Jan25110340@cas.org> Distribution: gnu Date: Mon, 25 Jan 1993 20:48:58 GMT Lines: 18