Yes. LIke every "real programmer" I like to develop languages. E.g. I have also developed a scripting language for the multimedia chess programm "Der Schweinehund". And I have made a 16-Bit FPGA processor...DarkSide wrote:Hi Dr.
Sorry ,About Chess-Advice-Language Che++) it has been developed by you? i found almost nothing in the web, and I have interest in knowing more of, I do not know why it has not been used by others programmers given its virtues, like you can add knowledge without reducing the speed of search, and so on.. I hope you can talk a little more about this topic Dr.
Thanks for you time
Regards
Che was intended only for internal use. Andreas Mader has written a Che++ manual. One could encode chess knowledge in a Basic-like language with some additional chess functions and terms. The code was translated to an internal representation, similar to the Java virtual machine (I designed Che around the same time Java was developed. The idea of making a virtual machine was well known).
This code was primarily processed in the so called Oracle. The Oracle sets parameters of the evaluation and of the search. This is done only once per move at the root-position. As it is done only once the overhead of using an interpreted code does not matter. There is practically no time penalty.
The success was mixed. Some Che enthusiast claimed that they have improved the programm with the Che rules by about 50 percent. I stoped the development after the "Seirawan-desaster" at the Aegon tournament in ????
Nimzo was so far the best ranked programm in the tournament and played on the center-court against GM Seirawan. The Che code had the reasonable rule: If you have not yet castled and the pawns on one side are already pushed forward, keep the pawns on the other side back. If the opponent played e.g. Bg5, Nimzo had the tendency to play h4 and after Bh4, g5.
Seirawan played Bg5, Nimzo wanted to play its favorite moves (which were correct in this position), but the Che-rules said: You have already played b5, h6 followed by g5 is bad. Unfortunately the rule was only specified for the root-position. So the search invented some "Null-Move" and calculated in the variation the favorite line. Nimzo played the "Null-Move", Seirawan played another move, the bishop was still there, the same reasoning repeated. Actually it repeated for a dozen of times, Nimzo played one nonsense move after another, the crowd gathered around the centre-court and cheered each move. Nobody - besides myself - could explain why a programm which has beaten before GMs plays moves no 1200 Elo player would have played. The absolute nightmare for every programmer.
The problem was, that with Che one created 2 knowledge bases. The internal hard coded knowledge and the Che rules. The search is usually very tricky to find the inconsistency between this 2 rule-sets.
Chrilly