Author: leonid
Date: 15:13:58 09/07/99
Go up one level in this thread
On September 07, 1999 at 15:06:38, blass uri wrote: >On September 07, 1999 at 14:52:55, leonid wrote: > >>On September 07, 1999 at 07:26:29, blass uri wrote: >> >>>On September 07, 1999 at 06:40:02, leonid wrote: >>><snipped> >>>>Brute force search is the base of good chess game. True or not true? >>> >>>Not true. >>>There are positions when humans can see more than chess programs because >>>programs do brute force search and humans do selective search. >>> >>>Uri >> >>If it is so, the reason for this is that the brute force search is limited >>for now up to 10 plys, more or less. When good computers could do this up to >>20 plys, all the "human feeling" will be overpassed. Then the only good player >>will be the computer itself. Human will drop this game with the disgust, >>overwhelmed by paintful "complex of inferiority". >> >>Leonid. > > >1)computers may be better only because they are faster but not because brute >force is good for chess. >2)There are cases when humans can see 60 plies by selective search(in >correspondence games) so 20 plies are not enough. > >Uri Brute force probably is the base of everything. If computer could see 4 moves through the "brute force" this signify that through "selective search" it can reach already 7 moves. The success of actual chess game is the recognition that "brute force" search still not feasible and the only way around is "selective search". Actually "brute force" search for mate can be done on modern computers up to 8 plys in some few seconds. But search for inevitable mate through the "selective search" can go easely up to 26 plys. The last search can take only the split of the second to be performed. Leonid.
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.