Hi Reinhard,
I am beginning to get a bit tired of this debate. Most people (and I am no exception) just repeat their old points, and there is little progress. After this post, I hope to be able to refrain from participating in the debate.
Reinhard Scharnagl wrote:But searching something better matching I found that pupils could 'create' their solutions and articles to tasks given from their teachers by searching in the web for foreign solutions. I think it is a bad situation where certificates could be reached by such a cheating. So it would be not a good act to publish one's successful homework to 'help' other pupils.
But in the case of computer chess, using somebody else's source code as a starting point is not necessarily cheating. In many cases, it is in fact the most sensible thing to do. There are people who do research in game playing algorithms, but have no time or interest to develop their own chess engine. They may, for instance, be working mainly on some other strategic game (like shogi, othello or checkers), but still want to test whether some new algorithm they have invented is effective in computer chess. In such cases, starting with a strong open source program is clearly preferable to writing a complete chess program from scratch. Not only do they save a lot of time, the results of the research also becomes more valuable. In sufficiently weak chess engines, almost all tricks seem to work. Seeing that a new algorithm is effective in a well-known, stable and strong open source program is a much more interesting data point than seeing that the same algorithm works in some program the author wrote in a short period of time.
This is not purely hypothetical. A case in point was when Michael Buro (author of Logistello, which used to be the strongest othello program) used Crafty to test whether MPC pruning (a selective search technique used by Logistello) works in chess.
Different people are interested in chess for different reasons. You seem to be mainly attracted by the competitive side of chess programming (I think you called it a "brain sport" in a recent post to this forum). This is of course fine, but you sometimes seem to forget that not everybody shares this view. I have little interest in the competitive side of computer chess, and in "brain sports" in general. I have no desire to compete with Stefan Meyer-Kahlen, you, or anybody else. My interest is in game playing algorithms, and in artificial intelligence programming. I want to contribute, in my own small way, to the continuation of the great work started by Alan Turing and Claude Shannon.
If there would be a tournament in which my program should participate I would not agree to have there some patchworked opponents where it overmore should be my task to investigate and proof them to be clones or recycled intellectual properties of others.
I think you greatly overestimate this problem. Cheating in computer chess tournaments happens very rarely, and the cheaters do get caught. It is not too hard to detect a clone of an open source engine, and it is not likely that you will have to do the work yourself. Any new, unexpectedly strong engine is guaranteed to attract lots of attention, and sooner or later somebody will want to investigate it.
Among the top amateur engines today, there is not a single program (not even List) which I suspect to be a clone. I see no reason to believe that this will change radically in the future. Cloning seems to be more common on lower levels, where there has been numerous TSCP and Faile clones. Of course this is still annoying, but you can't claim that it destroys the competition.
Tord