Author: Christophe Theron
Date: 07:51:26 12/30/01
Go up one level in this thread
On December 29, 2001 at 22:11:54, Tom Kerrigan wrote:
>On December 29, 2001 at 19:04:38, Christophe Theron wrote:
>
>>On December 29, 2001 at 16:44:51, Tom Kerrigan wrote:
>>
>>>On December 29, 2001 at 11:55:21, Christophe Theron wrote:
>>>
>>>>On December 29, 2001 at 04:40:03, Tom Kerrigan wrote:
>>>>
>>>>>On December 29, 2001 at 04:24:55, Otello Gnaramori wrote:
>>>>>
>>>>>>On December 28, 2001 at 23:51:33, Miguel A. Ballicora wrote:
>>>>>>
>>>>>>>On December 28, 2001 at 21:57:03, Christophe Theron wrote:
>>>>>>>
>>>>>>>>
>>>>>>>>I think it is rather well established by now that human players are, like
>>>>>>>>computers, studying a chess tree, trying to find the best possible continuation.
>>>>>>>
>>>>>>>Actually, not. That is the vicious influence from Kotov's teaching that
>>>>>>>made everybody think that they should think like a tree.
>>>>>>>There are recently two books that finally made in writing what everybody
>>>>>>>suspected. "Improve your Chess Now" by J. Tisdall and "Secrets of Practical
>>>>>>>Chess". Not even amateurs are taught NOT to think like a tree nowadays, and the
>>>>>>>best book about it is "How to reasess your Chess" by J. Silman.
>>>>>>>
>>>>>>>First quote from Tisdall's book, first Chapter ("The Fabled Tree of Analysis"):
>>>>>>>
>>>>>>>"I do not think like a tree - do you think like a tree?" GM Anatoly Lein.
>>>>>>>
>>>>>>>There are certain situations where a strong player think like a tree, but
>>>>>>>their thinking should certainly not be characterized by that.
>>>>>>>
>>>>>>
>>>>>>Taking as an example Kasparov, he is renowned for his powerful calculations
>>>>>>capabilities of the variations (...tree), both in analysis and both in OTB.
>>>>>
>>>>>Being able to come up with variations does not a tree searcher make.
>>>>>
>>>>>A SEE can come up with a variation and it's not searching anything.
>>>>
>>>>
>>>>
>>>>I don't think so.
>>>>
>>>>My SEE for example is a recursive function. It is a tree searching algorithm,
>>>>but a special one
>>>
>>>Maybe you should call it a DEE then.
>>>-Tom
>>
>>
>>
>>Why DEE???
>
>Dynamic Exchange Evaluator. If you are visiting different positions in your SEE,
>then I don't see that it's so Static anymore...
>-Tom
I do not really visit them. There is no make/unmake move during my SEE.
My SEE does a tree search without making/unmaking the moves (which is a
classical scheme for a SEE).
I have written it as a recursive function because it's much simpler this way,
but it could as well be a big loop. It would be faster then, but less readable,
so I prefer it this way.
However, without making/unmaking any move I could output the capture sequence it
"searches". That's why I say it is virtually visiting a tree (a degenerated one
in this case, where each node has no more than one successor).
Christophe
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.