Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Anyone for an 'increasing expectation' heuristic?

Author: Andrew Williams

Date: 06:24:49 05/03/99

Go up one level in this thread


On May 03, 1999 at 06:17:58, Francis Monkman wrote:

>
>On May 03, 1999 at 05:45:19, David Blackman wrote:
>
>>This is a bit tricky with alpha-beta because you don't get exact evaluation for
>>anything except the "best" move. Hence the idea of using node counts. Any other
>>ideas for finding 'expectation-value'?
>
>So how come ChessBase analysis is able to display 'n' (I haven't tried past
>about 30, and generally use 7) lines of analysis, all with regularly updated
>scores? It's largely through watching the relative performances of moves during
>the search that led me to realize that here was a large amount of quantifiable
>information about 'the state of the game', that seemed to be just wasted...
>
>Francis

I don't have ChessBase, but I think any such feature must be based on doing
n searches - which should be n times slower. If you ask for the best two moves
does it take (a little less than) twice as long? Perhaps I'm missing something?

Andrew



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.