Author: Angrim
Date: 22:12:26 09/15/00
Go up one level in this thread
On September 15, 2000 at 21:04:53, Dann Corbit wrote: >I realize that programs do prune differently. However, at whatever the author >really believes are the strongest play settings they do have some idea of what >half move they are processing, I am sure, for any algorithm. If not, where is >the algorithm so that I can read about it? > Look up "conspiracy search" and "proof number search" neither of which searches one ply fully before starting on the next ply. Both follow the general pattern of expanding the leaf node of the tree which seems most likely to improve the result of the search. With proof number search(PN-search) it is common to be searching one line 30 ply deep while not having bothered to search another move more than 2 ply deep. And PN-search is actually used in a fair number of game playing engines, for instance in suicide chess all of the top engines do a short PN-search to check for forced wins before starting the main alpha-beta search. This is much more common in suicide chess than in real chess because suicide chess is more prone to deep/narrow forced wins. Angrim
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.