Computer Chess Club Archives

Search

Terms

Messages

Subject: Iterative deepening deep increment

Author: Alvaro Jose Povoa Cardoso

Date: 14:08:16 02/27/01

By definition the iterative deepening procedure calls Search() several times,
and each time it increments _Depth_ by one.
But what if we increment by two?
Isn't a waste of time stepping just one ply deep at a time?
In my checkers program, I increment _Depth_ by two (2,4,6,8,10,12,14,16...) and
it seams to work better than stepping by one ply (2,3,4,5,6,7,8,9,10,11,12,...).
Surely a previous search at _Depth-2_ gives a good PV to try first at this
iteration.
Comments anyone?
Does this aply to chess?

Thank you
Alvaro Cardoso

Re: Iterative deepening deep increment Antonio Dieguez 15:37:04 02/27/01
Re: Iterative deepening deep increment Robert Hyatt 15:36:03 02/27/01
- Re: Iterative deepening deep increment Christophe Theron 16:20:48 02/27/01
  - Re: Iterative deepening deep increment Robert Hyatt 18:40:04 02/27/01
- Re: Iterative deepening deep increment Ricardo Gibert 15:57:47 02/27/01
  - Re: Iterative deepening deep increment Christophe Theron 16:17:55 02/27/01
    - Re: Iterative deepening deep increment Ricardo Gibert 16:28:52 02/27/01
      - Re: Iterative deepening deep increment Christophe Theron 16:54:43 02/27/01
        
        Re: Iterative deepening deep increment Peter McKenzie 18:17:30 02/27/01
        
        Re: Iterative deepening deep increment Robert Hyatt 18:43:34 02/27/01
        
        Re: Iterative deepening deep increment Joshua Lee 08:32:34 02/28/01
        
        Re: Iterative deepening deep increment Robert Hyatt 10:31:14 02/28/01
Re: Iterative deepening deep increment William H Rogers 15:13:43 02/27/01
- Re: Iterative deepening deep increment Severi Salminen 02:49:37 02/28/01

This page took 0.01 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.