Computer Chess Club Archives


Search

Terms

Messages

Subject: To do a Brute Force of 9 Ply, how many Positions are Searched?

Author: Terry Ripple

Date: 15:01:15 07/30/99


  I noticed that several of the top programs will initially do a brute force
followed by a selective search. For instance, when it shows a 9/30 in it`s
search, does this mean that it`s performing 9 ply brute force and then
performing up to 30 ply selective to complete its search for the position? I`am
using the Hiarcs 7.32 program!

  So, getting back to my question: If my program performs a 9 ply brute force
search, then this means it`s searching every possible move on the chess board to
complete a 9 ply brute force. This seems that it would need to search billions
of moves at times to complete such a task that comes from a brute force search.
This seems almost impossible with a home PC to  do this kind of search with a
time control of 40/2hrs., but i know that it is doing this very task as this is
what it shows!

  How many moves or positions does it look at to perform a 9 ply brute force?



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.