Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: a question to Tord about detecting threats in null move

Author: Uri Blass

Date: 18:08:15 10/04/03

Go up one level in this thread


On October 04, 2003 at 19:56:57, Vincent Diepeveen wrote:

>On October 04, 2003 at 17:02:11, Uri Blass wrote:
>
>[some clown remarks from Uri zipped]
>
>>In one sentence:
>>I think that in a fair tournament programs should use the same hardware or the
>>best hardware that they can use under some price.
>
>I paid nothing and just asked a question to government: "what kind of machine do
>you guys have for me to use".

Your government payed a lot for the machine.
Other programmers have not government that payed a lot for them.

It seems that Diep is going to use the best machine that it can use when other
programs are not going to do it if the programmer is not very rich and the
programmer is not supported by someone who buy the fastest machine for him.




>
>V/d Herik replied: "500 processors and a few pages a processor will do Vincent?"
>
>I responded FINE, and got the machine for free after writing 500 pages.
>In between reports and such added it's more like 1500 pages now in total, but
>that is no problem. Answerring all the stupidity here is way more pages.
>
>A dutch saying namely says: "a fool can ask more questions than 100 wise men can
>answer".
>
>So don't worry, you seem to do a good job here. Perhaps Christophe will again
>write a very cynical posting about to never look at other programs and other
>people as being a fine thing and i bet you'll step into it again :)

I did not decide to do something because christophe told me it and I also
learned from other programs but not everything that is in other programs I can
implement in my program.

I know about a lot of improvements to do that I did not do and one of the
reasons is that I spend too much time on forums to reply to posts.

Uri



This page took 0.02 seconds to execute

Last modified: Thu, 07 Jul 11 08:48:38 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.