Author: Uri Blass
Date: 02:45:47 12/31/05
Go up one level in this thread
On December 30, 2005 at 09:32:25, Uri Blass wrote:
>I am starting to look at the differences between toga and fruit
>Note that I asked in the past about differences and got no response about it.
>
>Note that I had no idea how to detect them fast but thanks to dann corbit that
>sent me the link that I give also in this post I can detect the differences in a
>reasonable time inspite of the fact that I probably need to compare every file
>only to get the response that the selected files are identical in most case but
>fortunately doing it is only few seconds for a file so I guess that I am going
>to spend only 15-20 minutes in getting the response the selected files are
>identical
>
>http://winmerge.sourceforge.net/
>
>
>Note that I find a lot of differences in eval.cpp(61 differences)
>
>only first difference seem to be 45 additional lines in Toga
>
>const int KnightPosMatrix[2][64] = {
> -8, -4, 0, 0, 0, 0, -4, -8,
> -4, 0, 8, 8, 8, 8, 0, -4,
> 0, 8, 16, 16, 16, 16, 8, 0,
> 0, 8, 16, 16, 16, 16, 8, 0,
> 0, 8, 16, 16, 16, 16, 8, 0,
> 0, 8, 16, 16, 16, 16, 8, 0,
> -4, 0, 8, 8, 8, 8, 0, -4,
> -8, -4, 0, 0, 0, 0, -4, -8,
>
> -8, -4, 0, 0, 0, 0, -4, -8,
> -4, 0, 8, 8, 8, 8, 0, -4,
> 0, 8, 16, 16, 16, 16, 8, 0,
> 0, 8, 16, 16, 16, 16, 8, 0,
> 0, 8, 16, 16, 16, 16, 8, 0,
> 0, 8, 16, 16, 16, 16, 8, 0,
> -4, 0, 8, 8, 8, 8, 0, -4,
> -8, -4, 0, 0, 0, 0, -4, -8,
>};
>
>const int KnightOutpostMatrix[2][64] = {
> 0, 0, 0, 0, 0, 0, 0, 0,
> 0, 0, 0, 0, 0, 0, 0, 0,
> 0, 0, 0, 0, 0, 0, 0, 0,
> 0, 2, 5, 10, 10, 5 , 2, 0,
> 0, 2, 5, 10, 10, 5, 2, 0,
> 0, 0, 4, 5, 5, 4, 0, 0,
> 0, 0, 0, 0, 0, 0, 0, 0,
> 0, 0, 0, 0, 0, 0, 0, 0,
>
> 0, 0, 0, 0, 0, 0, 0, 0,
> 0, 0, 0, 0, 0, 0, 0, 0,
> 0, 0, 4, 5, 5, 4, 0, 0,
> 0, 2, 5, 10, 10, 5, 2, 0,
> 0, 2, 5, 10, 10, 5, 2, 0,
> 0, 0, 0, 0, 0, 0, 0, 0,
> 0, 0, 0, 0, 0, 0, 0, 0,
> 0, 0, 0, 0, 0, 0, 0, 0,
>};
>
>static int lazy_eval_cutoff = 200; /* Thomas */
>static bool LazyEval = false; // true
>static bool KingSafety = false; // true
>static int KingSafetyMargin = 1600;
>static bool king_is_safe[ColourNb];
>
>second difference is the following line that is added in Toga
>
>static const int KingAttackOpening1 = 20; // was 20
>Note that there is also line that is very similiar in it
>
>static const int KingAttackOpening = 20; // was 20
>
>third difference is the following lines that are added in Toga
>
>static const int ProtectedPassedOpening = 10;
>static const int ProtectedPassedEndgame = 20;
>
>4th difference seem to be some empty line that was added in toga(but most of the
>differences are not of that type).
>
>I wonder what is my error when I find more than 50 lines that were changed when
>based on other posts that I read there are only 50 lines that were changed or
>even only 47 lines that were changed.
>
>Uri
I asked Ryan about it and the reply that I got is that the claim of 50 lines was
a joke but a lot of lines are meaningless so maybe there are only 50 useful
lines that were changed.
I am not convinced from his reply that toga has counter productive changes at
long time control and I think the only way to support it by evidence is if you
can prove that Toga is weaker in some hard test suite like the nolot test suite
and I do not know if there is an evidence for it(in nolot number 1 toga is
faster than gambit fruit)
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.