Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: futility pruning? -- Too many nodes

Author: Charles Roberson

Date: 09:14:17 11/10/03

Go up one level in this thread



   When you call search with depth == 2, your algorithm does a 3 ply search.
   Search d=2
   search d=1
   search d=0  here your algorithm generates and makes all moves and calls
                qsearch for each.
          Typical is to call qsearch and make none of the moves at this level.



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.