Author: Heiko Mikala
Date: 12:16:45 10/17/98
Go up one level in this thread
On October 17, 1998 at 13:01:27, blass uri wrote: >On October 17, 1998 at 12:37:37, Christophe Theron wrote: > >>Amir has a strong program that seems to search very deep. > >I am not sure about "seem to search very deep" >If this was the case It was a better solver than other program and I do not see >that it is better in tactics than other top programs. Not necessarily. To search deeper you have to be more selective. Being more selective also means having a bigger chance of missing some important things. On the other hand you can have a slow program with good extensions that is tactically strong. I am very sure, that if there were an optimal selective program and an optimal "brute-force extender" that both programs would produce exactly the same results. It's just a question of how you look at it: cutting out the unimportant things (=beeing selective) or only look at the important things (=extend). The result should be exactly the same. Greetings, Heiko.
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.