Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Some vindications concerning the activation-constraint of Fruit

Author: Uri Blass

Date: 05:39:38 09/27/05

Go up one level in this thread


On September 27, 2005 at 05:58:15, Joachim Rang wrote:

>On September 26, 2005 at 16:47:09, Dann Corbit wrote:
>
>>At some point, I think you will have to change your method of protection.
>>Consider if you sell 100,000 copies some day in total volume.  For sure, every 5
>>years almost all of those machines will change.  Now, imagine handling the email
>>traffic.
>>
>>But while your volume is still low, I think that method will probably work fine.
>> It won't prevent me from buying a copy.
>
>Our threshold is much lower. As soon as we have sold 1000 copies we will skip
>hardware protection. However even this goal seems far away.
>
>Joachim

Can you give tell us how many copies did you sell or is it a secret?

Note that I already ordered fruit by the company that I work in it in the last
hour.

Note that first tried to use my gmail account as email address and it rejected
it and told me that it does not accept gmail or free emails like hotmail so I am
not sure if you got emails that I sent from my gmail account and
I will post here the last email that I sent from my gmail account:



subject of the email:
Suggestions for additional features for analysis in fruit

content of the email:

Note that I sent 1 to fabien but I am not sure if he got it because I noticed
that he has different email address in the fruit page(not hotmail).

1)I use chess programs for correspondence games and I think that having an
option to see all lines that were searched for significant time may be an
interesting option.

If I give Fruit to search 20,000,000,000 nodes in some hours I like to see all
the lines that it searched more than 100,000,000 nodes or something similiar.

A possible way to do it is to have array nodes[depth] that give for every
remaining depth,the number of nodes that were searched before getting that
remaining depth.

If the difference in nodes[depth] is more than 100,000,000 fruit may write the
line that it searchs to a text file before updating nodes[depth]

100,000,000 is of course only an example and the user may change that number.

2)Another idea is to give the user an option to do tasks like analyzing position
A for 10 hours and later analyzing next best move for 5 hours and later analyze
position B for 20 hours and later analyze 2 best moves in postion C for 13 hours
and save all the analysis.

Correspondence players may be interested in doing this type of tasks when they
cannot be near the relevant computer for 48 hours.
Maybe this can be done by some bat file(I do not know) and unfortunately I still
did not get a response to question that I asked in the winboard forum about it.

See http://wbforum.volker-pittlik.name/viewtopic.php?t=3564

Uri



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.