Author: John Wentworth2
Date: 09:46:10 03/12/03
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.
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.