Author: Mogens Larsen
Date: 03:26:09 01/03/01
Go up one level in this thread
On January 03, 2001 at 06:18:08, Uri Blass wrote: >No. > >This is not what I meant. > >I meant to a regular long search >when the only difference is that the program tells me more information > >For every illogical move of black that was considered >for more than 1 second it should tell me the killer move. >(the killer move does not have to be the best move because the program has no >idea >about the best move after a long search). I don't think any program is capable of doing that. The closest thing is multivariational analysis, where the program analyzes the x best moves simultaneously. In most cases that will demonstrate why it prefers a specific move by choosing a sufficiently large value for x, but not always. Mogens.
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.