Computer Chess Club Archives

Search

Messages

Subject: Iterative Deepening

Author: John Coffey

Date: 16:31:36 09/20/98

We all know that searching 1 ply, 2ply, 3ply, 4ply etc produces faster
results than just searching 4 ply by itself because the move odering
improves the efficiency of the alpha-beta pruning.

But ...

Has this approach ever been used above the base of the tree?  i.e. If
I am doing a seven ply search and I make the first move for white and
I am searching the black responses, at this point would it pay to do
a 1ply, 2ply, 3ply, 4ply, 5 ply, and finally a 6 ply search?

If so, then the number of sub-searches would get quite high.

John Coffey

• Re: Iterative Deepening Don Dailey 18:22:02 09/21/98
• Re: Iterative Deepening Pat King 04:10:13 09/21/98
  • Re: Iterative Deepening Tom Kerrigan 14:58:23 09/21/98
    • Re: Iterative Deepening Pat King 06:03:45 09/22/98
      • Re: Iterative Deepening Robert Hyatt 11:04:49 09/22/98
• Re: Iterative Deepening Robert Hyatt 17:49:52 09/20/98
  • Re: Iterative Deepening John Coffey 18:19:45 09/20/98
    • Re: Iterative Deepening José de Jesús García Ruvalcaba 19:04:46 09/20/98
• Re: Iterative Deepening Bruce Moreland 17:24:54 09/20/98
• Re: Iterative Deepening Roberto Waldteufel 16:38:25 09/20/98

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.