Author: Bruce Cleaver
Date: 11:37:16 07/28/99
Any of you savants out there who can take a stab at this question, I'd appreciate it. I recently read a Hans Berliner paper on his B* search algorithm, and he mentioned Conspiracy-number searching. In his opinion, the reason CN seaching has failed is that the computer has to do a breadth first search of conspiracies, with no idea of what will break a particular conspiracy, or which one is easiest to break. Can anyone elucidate a little further on this idea? Any other opinions as to why it doesn't live up to its promise? Thanks in advance... Bruce
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.