Sloppy 0.1.1 released

[Christopher Conkie]

Updated versions- while they last!

Special Offer!

Buy now and get the Clone Chess Rating List for free (thats CCRL for short).

[geots]

Updated versions- while they last!

Special Offer!

Buy now and get the Clone Chess Rating List for free (thats CCRL for short).

Whew. Shame on you

[Daniel Mehrmann]

We already have two engines with this inside. I doubt we need 3.

Christopher

2 or 3 ?

Are you kidding ?

At least 20 engines or more. The "dark" number should be even higher....

That's computerchess of today

Best,
Daniel

[geots]

Updated versions- while they last!

Special Offer!

Buy now and get the Clone Chess Rating List for free (thats CCRL for short).

Dont let this go to your head, but we all got together and named it in honor of you- it actually stands for Chris Conkie Rating Lists>

[Christopher Conkie]

I've compiled a 64-bit GCC-Mingw64 version >

http://www.2xupload.de/file/e9fbbccf557 ... a.zip.html

This is untested - I don't have a 64-bit Windows environment to test, so don't complain if it doesn't work

Jim.

Toga works ok.

Christopher

Oh, it was Toga, not Sloppy? thank you, Chris, thank you so much!

ps:
may be the author name is wrong too and it is not Ilari Pihlajisto but Tomas Gaksch?

I doubt it.

Fabien Letouzey is much more likely......

Ryan Benitez took a look at the engine and said Ilari didnt even have to make it open source because everything is written in his own way. Thank you for your kind words sir.

I'm sure Ryan knows what this is......

Code: Select all

/* Piece/square tables.  */
static const int pcsq_pawn_op[64] =
{
	  0,   0,   0,   0,   0,   0,   0,   0,
	-15,  -5,   0,   5,   5,   0,  -5, -15,
	-15,  -5,   0,   5,   5,   0,  -5, -15,
	-15,  -5,   0,  15,  15,   0,  -5, -15,
	-15,  -5,   0,  25,  25,   0,  -5, -15,
	-15,  -5,   0,  15,  15,   0,  -5, -15,
	-15,  -5,   0,   5,   5,   0,  -5, -15,
	  0,   0,   0,   0,   0,   0,   0,   0
};
etc. (snipped by SzG)

We already have two engines with this inside. I doubt we need 3.

Christopher

I am sure that for the values of these tables there are not very much sensible choices so sooner or later there will be identical tables in a lot of chess programs if the authors don't want to make them play badly intentionally.

I hope so Gabor. The door is open. Much of Sloppy is ok. Why he would just do all that work and then copy the toga psqt is beyond me.

He should change them as you say.

[ilari]

Uri can help you better, he said that he did something to make his engine print less info in fast games, that way the engine uses more time on search/eval. Where is Uri when we need him, I have no clue what I am talking about.

It makes sense in games where Sloppy might have to move extremely fast. However, even with one second to move, printing the full pv shouldn't affect things too much. I confirmed what your results with the 1m + 1sec time control: Sloppy won only 44% of points against BugChess.

[Thomas Mayer]

Hi Daniel,

We already have two engines with this inside. I doubt we need 3.

Christopher

2 or 3 ?

Are you kidding ?

At least 20 engines or more. The "dark" number should be even higher....

That's computerchess of today

Best,
Daniel

that's why I slowly lose interest in computer chess and especially the new engines. Seems to be common sense now to start with something fruity, pour in some toga, mix it up with some own idea to not be too strong in the beginning and finally present it as something genuine. Of course if done well, top 30 + general worship is guaranteed. The funny thing is: even when the author himself says that it is clone & patchwork this doesn't change anything in the almost general worship.

Greets, Thomas

[Graham Banks]

that's why I slowly lose interest in computer chess

That's a real shame Thomas, because many of us would love to see a new Quark release.

Regards, Graham.

[ilari]

I am sure that for the values of these tables there are not very much sensible choices so sooner or later there will be identical tables in a lot of chess programs if the authors don't want to make them play badly intentionally.

I hope so Gabor. The door is open. Much of Sloppy is ok. Why he would just do all that work and then copy the toga psqt is beyond me.

He should change them as you say.

Actually, the tables probably aren't optimal (for Sloppy). I'm using them because I didn't have time to tune them, and because they're a lot better than nothing. I already rewrote the king-attack eval, not to make Sloppy more original, but stronger.

And why would I do all this work and then copy Fruit's/Toga's eval tables? I'll quote myself (http://wbforum.vpittlik.org/viewtopic.php?t=6852):

It's a Xboard/Winboard chess engine, and also my first release-worthy C application. The goal was to really learn C programming, so I thought a chess engine would be a good challenge.

The #1 priority was to write bug-free, easy-to-read and easy-to-improve code and use sane data structures and algorithms. So I just took a look at the Fruit 2.1 evaluation function and pretty much rewrote a simplified bitboard version of it. When I get the time I'll start focusing on the evaluation.

The reason for this is that Sloppy was a programming challenge, not a chess challenge. The evaluation function is a somewhat simple thing programming-vise, but it requires a lot of testing and chess-knowledge. So to get a release out before I die of old age, I decided to use Fruit's weights.

[Christopher Conkie]

that's why I slowly lose interest in computer chess

That's a real shame Thomas, because many of us would love to see a new Quark release.

Regards, Graham.

Would you like a disassembled Rybka Quark to test or a Fruity/Toga one?

We could have one ready in ohh....about 30 minutes if thats ok?