Author: Omid David Tabibi
Date: 09:59:46 03/12/03
Go up one level in this thread
On March 12, 2003 at 12:46:10, John Wentworth2 wrote: >Today, I put a searching mechanism into place which right now is a brute force >approach. Totally amazed me to see how fast the tree grows and the length of >time it takes to get to the next ply. > >What I would like to know from the experts here are what are the alternatives? > >How can I limit the number of branches since there doesn't seem to be a way for >a program to know which moves are ridiculous without actually "seeing" the >outcome. > >Should I do a brute force approach for first couple of nodes then based on that >do something else? > >Any help appreciated,thanks. For a brief overview of different algorithms see: http://www.cs.biu.ac.il/~davoudo/deep_search1.pps [I used that slide show for a lecture addressed to people from different fields of computer science (AI and non-AI) so the description is very simple.] Bruce Moreland's website contains more detailed description of algorithms: http://www.seanet.com/~brucemo/topics/topics.htm
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.