Author: leonid
Date: 09:56:06 03/24/00
Go up one level in this thread
On March 24, 2000 at 07:50:05, Andrew Williams wrote: >On March 24, 2000 at 07:18:44, leonid wrote: > >>On March 23, 2000 at 13:08:51, John Coffey wrote: >> >>>Does interative deepening insure that a program will pick the fastest >>>improvement? I.e. if a program can improve its position by .1 pawn in 3 moves, >>>how do I know that it won't choose a .1 improvement in 5 moves instead? >>> >>>John Coffey >> >>What is the interactive deepening? >> >>Thanks, >>Leonid. > >I think he means "iterative deepening". Instead of starting out by trying to >search a position to depth 6, you do a depth 1 search then a depth 2 search >then depth 3 etc. This has two advantages: (a) It is quicker. (b) It gives >you something sensible to play if you run out of time. > >Andrew Thanks! Now I see what it is all about. But do this signify that all your plies must have some uniformal structure? I asking this since it was in my mind for already quit a long time. Use uniformal interchangeable ply structure, for the sake of simplicity and eaeasily stoppable thinking process, or do it otherwise? Maybe loose in easely interruptable thinking process but gain in speed because some ply will be done in very specific way? Or maybe both can existe together? At least, Hyatt said me one day that whe have in its logic one ply written in very specific way. In my I have them more that one. Leonid.
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.