Computer Chess Club Archives

Search

Messages

Subject: Re: improvement in least number of moves

Author: leonid

Date: 04:18:44 03/24/00

Go up one level in this thread

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.

• Re: improvement in least number of moves Andrew Williams 04:50:05 03/24/00
  • Re: improvement in least number of moves leonid 09:56:06 03/24/00
    • Re: improvement in least number of moves John Coffey 12:00:12 03/24/00
      • Re: improvement in least number of moves leonid 18:44:57 03/24/00

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.