Computer Chess Club Archives

Search

Messages

Subject: Internal Iterative Deepening (in Crafty)

Author: Steve Maughan

Date: 12:06:35 01/04/99

I have been looking through the source code for Crafty and noticed that the
Search routine used "Internal Iterative Deepening" to get a good move to play at
an internal node.  I was puzzled as to the actual benefit of this routine.  I
can see that it will return a good move but assume that this is a costly method
for finding a such a move.  Does it really speed up the search by that much?
How much?  Does "everyone" do it?

• Re: Internal Iterative Deepening (in Crafty) Larry Griffiths 23:18:42 01/09/99
  • Re: Internal Iterative Deepening (in Crafty) Robert Hyatt 07:41:48 01/10/99
    • Re: Internal Iterative Deepening (in Crafty) Larry Griffiths 10:09:40 01/10/99
  • Re: Internal Iterative Deepening (in Crafty) Steve Maughan 07:22:04 01/10/99
    • Re: Internal Iterative Deepening (in Crafty) Robert Hyatt 07:44:26 01/10/99
• Re: Internal Iterative Deepening (in Crafty) Robert Hyatt 14:51:11 01/04/99
  • Re: Internal Iterative Deepening (in Crafty) Steve Maughan 15:06:15 01/04/99

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.