Computer Chess Club Archives

Search

Messages

Subject: Question: When to Use Internal Iterative Deepening

Author: William Bryant

Date: 19:39:21 02/12/01

My understand is, Internal Iterataive Deepening is used when searching the
root PV node and you encounter a position for which there is no hash table
best move.  Specifically, this is done during the full width part of the
tree (rather than the PVS part of the search).

My program at present tests for this by comparing beta to alpha.
ie if (beta == alpha+1) then this is the PVS part of the tree and IID should
be skipped.

This doesn't help at all so I think I'm missing something in the implementation.

Any comments or suggestions would be appreciated.

William
wbryant@ix.netcom.com

• Re: Question: When to Use Internal Iterative Deepening Robert Hyatt 21:13:22 02/12/01
• Re: Question: When to Use Internal Iterative Deepening William Bryant 20:00:36 02/12/01
  • Re: Question: When to Use Internal Iterative Deepening Robert Hyatt 21:16:24 02/12/01
    • Re: Question: When to Use Internal Iterative Deepening Tim Foden 00:03:16 02/13/01
      • Re: Question: When to Use Internal Iterative Deepening Robert Hyatt 07:18:45 02/13/01

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.