Author: Christophe Theron
Date: 14:46:34 12/02/98
Go up one level in this thread
On December 02, 1998 at 15:07:50, Komputer Korner wrote:
>On December 02, 1998 at 12:38:23, Christophe Theron wrote:
>
>>On December 02, 1998 at 03:08:27, Kim Hvarre wrote:
>>
>>>On December 02, 1998 at 01:45:10, Christophe Theron wrote:
>>>
>>>>
>>>>Maybe Ed will answer too, but I can give you some info.
>>>>
>>>>As Ed and I have suspected right from the begining of the project, Rebel and
>>>>Tiger are very very different programs.
>>>>
>>>>It appears that we use different algorithms to achieve a relatively close level
>>>>of play.
>>>>
>>>>Some of these algorithms are incompatible with each other by nature. Maybe we
>>>>will be able to get something by exchanging them, but it is not sure.
>>>>
>>>>But there are other algorithms that are compatible in both programs. And this is
>>>>very interesting. Ed has found ideas that I have not found, and the opposite is
>>>>true also. In the case Ed describes, one of Tiger's selection algorithms that
>>>>did not exist in Rebel has been successfully implemented in Rebel.
>>>>
>>>>This algorithm is not really a programmer's trick. It is an idea taking
>>>>advantage of the nature of the chess game. I cannot say more, but I would rather
>>>>describe this as being knowledge, because it would certainly not work with other
>>>>games.
>>>>
>>>>And what is more exciting is that Ed -probably angry that he did not find the
>>>>idea himself- decided to improve it further. :)
>>>>
>>>>And he succeeded! This time I can learn from the changes he has done to my own
>>>>algorithm and improve Tiger in return!
>>>>
>>>>I expect this to happen again several times, with different things. We have just
>>>>begun exchanging ideas, and there is already a concrete result!
>>>>
>>>>
>>>> Christophe
>>>
>>>Hi Christophe,
>>>
>>>Thanks for Your answer, which is very interessting. As I understand it, Your
>>>"joint-venture" actual will improve without "selling out", i.e. in the mentioned
>>>case You get a faster seacher without degrading the "brightness" of the
>>>application!
>>>Sounds that we all have a lot to look forward to!
>>>
>>>BTW (it must have been quite an experience for Ed - as a rather "loner" to start
>>>exchanging idears... years ago I speculated about what would happen if Lang and
>>>him went together and now we all see an equivalent - for sure very, very
>>>promissing!)
>>>
>>>All the best,
>>>
>>>kim
>>
>>Thanks!
>>
>>
>> Christophe
>
>Christophe, what do you call this new search algorithm?
>
>--
>Komputer Korner
It is rather a selection algorithm. This selection is added to to the one Ed and
I already used, and the result is that less nodes have to be searched to get
almost the same results.
I cannot give you the name without revealing too much about it. But who cares
anyway? :)
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.