Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: underpromotion and new trust

Author: Eduard Nemeth

Date: 09:04:13 02/23/06

Go up one level in this thread


On February 23, 2006 at 11:45:20, Marc D wrote:

>On February 23, 2006 at 01:53:58, Gabor Szots wrote:
>
>>I am just curious whether it is so extremely hard to implement underpromotions
>>in a program. Vasik Propaganda Rajlich put up a poll at his site, allegedly in
>>order to "Help us make the products that you want". The people here _want
>>underpromotions_ but, although promised several times, Rybka is still incapable
>>of it. Now is it really important for him what the masses want but the task is
>>simply too hard?
>>
>>Gábor
>
>iirc vasik stated that it is easy to implement but not on his high priority list
>because he wants to do other things (the search) first.
>
>Marc

Hmmm?

If easy to implement this, why he not deos for us? He can implement later the
same in the next release for us if is so easy, or?

Reason: for me that would trust new to it would construct, and others are
exactly the same for the moment!

German: für mich würde das neues vertrauen zu ihm aufbauen, und anderen geht es
genauso im moment!





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.