Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: You were most helpful Dann Thank You!

Author: chandler yergin

Date: 19:33:48 10/11/05

Go up one level in this thread


On October 11, 2005 at 22:05:13, Dann Corbit wrote:

>On October 11, 2005 at 22:02:16, chandler yergin wrote:
>[snip]
>>Semantics...Chessbase considers 1 ply(= half moves, i.e. one  move for each
>>side)
>>Of course the Program searches after every move.
>>1. e4 Search
>>1. ...e5   Search
>>Please lets not get hung up on semantics.
>
>This is the correct definition.
>
>If we are to reach a conclusion about a collection of information, if we do not
>have the same definitions for the terms then our conclusions will be
>meaningless.

Thank you Dann! Of course that was what I was striving to do.
Based on your feedback; I recognize another serious error which has caused
some confusion. My ineptness about Mini/Max. I did not describe as I should
have. Chessbase does use it but in a limited way.
The Tree notation window calculates percentages & ELO Performance for each
move. Those values are an average over all replies to the move. But a single
reply, might be much stronger than everything else, so that the average score
could be misleading. Clicking on the right window and using the Menu,
sselecting "Critical Line", Chessbase constructs a Variation consisting of
optimal play for both sides. To calculate this 'critical line', Chessbase
searches the Tree using the mini-max algorithm.
I hope this clears everything up to your satisfaction.
I apologize for the long Thread, but I think it was useful for all of us
to have a better understanding of "Stuff".
Your contribution was very insightful & helpful!
Guess we can stop the Thread?

Thanks a Bunch!
Chan





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.