Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: SSDF Junior 6 K6-2 - Shredder 2 P200MMX game 11-14. Now 11 - 3

Author: blass uri

Date: 07:15:25 01/11/00

Go up one level in this thread


On January 11, 2000 at 09:14:57, Stefan Meyer-Kahlen wrote:

>
>
>Please take a closer look at these four games, especially compare game 1+3 and
>2+4. It is a very good example of a program with book learning ability playing a
>program without book learning. S2 has no book learning and I am the only one who
>can be blamed for that. I don't want to complain too much, but in my opinion
>those matches are useless. I have only checked those 4 games but I bet you can
>fing more examples in the other games. Please correct me if I am wrong.

I do not think that you have to worry about these games because the important
results are the results of shredder4 and not the results of shredder2.

shredder2 results are very good if you count only the first games of the matches
against Junior6 and against tiger.

The achievments of shredder2 in these games is better than tiger and Junior6 if
you consider the fact thatshredder had the slow hardware.

I think that you should worry about the fact that shredder4 results in cadaqu's
tournament(Enrique's 40/40 games on a fast pentium) are not good and there is no
clear evidence from this data and the data of the ssdf that shredder4(the
engine) is clearly better than shredder2.

I do not say that shredder4 is not clearly better(the results may be statistical
illusion or maybe there is a problem with the autoplayer)


>
>Don't get me wrong. I think that Junior6 is probably very strong, but has also
>an excellent book learing algo, particularly against programs without any form
>of learning.
>
>Stefan

I think that the book learning of Junior can be improved.

I think that if learning tell you to play the same moves as previous game then
it is better to use 0 seconds for these moves if the opponent has only learning
by position(to save time if the opponent play in a different way) and the same
time as previous games if the opponent has no learning and is deterministic(to
prevent it from playing in a different way because of the permanent brain).

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.