Sloppy 0.1.1 released

Discussion of anything and everything relating to chess playing software and machines.

Moderator: Ras

Christopher Conkie
Posts: 6074
Joined: Sat Apr 01, 2006 9:34 pm
Location: Scotland

Toga 0.1.1 released

Post by Christopher Conkie »

Jim Ablett wrote: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
Top
User avatar
GenoM
Posts: 911
Joined: Wed Mar 08, 2006 9:46 pm
Location: Plovdiv, Bulgaria
Full name: Evgenii Manev

Re: Sloppy 0.1.1 released

Post by GenoM »

Christopher Conkie wrote:
Jim Ablett wrote: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?
take it easy :)
Top
Christopher Conkie
Posts: 6074
Joined: Sat Apr 01, 2006 9:34 pm
Location: Scotland

Toga 0.1.1 released

Post by Christopher Conkie »

GenoM wrote:
Christopher Conkie wrote:
Jim Ablett wrote: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......
Top
Tony Thomas

Re: Toga 0.1.1 released

Post by Tony Thomas »

Christopher Conkie wrote:
GenoM wrote:
Christopher Conkie wrote:
Jim Ablett wrote: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.
Top
Tony Thomas

Re: Sloppy 0.1.1 released

Post by Tony Thomas »

ilari wrote:
Tony Thomas wrote:At my time controls, sloppy is still lagging behind Bugchess after around 80 games. May be my time control (1m+1sec) is too fast for sloppy...
It's very likely. I haven't done proper testing with the "whole game in X minutes" time control. The time Sloppy allocates for each move is roughly "(time_left / 30) + extra_time". It's probably a good idea to replace "30" with a significantly bigger value. It's line 848 of search.c, in case someone wants to experiment. I sure do.

and simple tricks like the ones Uri recently did, printing the pv etc, could help it a lot.
Can you elaborate, how could printing the pv help?
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. :roll:
Top
Christopher Conkie
Posts: 6074
Joined: Sat Apr 01, 2006 9:34 pm
Location: Scotland

Re: Toga 0.1.1 released

Post by Christopher Conkie »

Tony Thomas wrote:
Christopher Conkie wrote:
GenoM wrote:
Christopher Conkie wrote:
Jim Ablett wrote: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.
:D

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
};
static const int pcsq_knight_op[64] =
{
	-135,  -25,  -15,  -10,  -10,  -15,  -25, -135,
	 -20,  -10,    0,    5,    5,    0,  -10,  -20,
	  -5,    5,   15,   20,   20,   15,    5,   -5,
	  -5,    5,   15,   20,   20,   15,    5,   -5,
	 -10,    0,   10,   15,   15,   10,    0,  -10,
	 -20,  -10,    0,    5,    5,    0,  -10,  -20,
	 -35,  -25,  -15,  -10,  -10,  -15,  -25,  -35,
	 -50,  -40,  -30,  -25,  -25,  -30,  -40,  -50
};
static const int pcsq_knight_eg[64] =
{
	-40, -30, -20, -15, -15, -20, -30, -40,
	-30, -20, -10,  -5,  -5, -10, -20, -30,
	-20, -10,   0,   5,   5,   0, -10, -20,
	-15,  -5,   5,  10,  10,   5,  -5, -15,
	-15,  -5,   5,  10,  10,   5,  -5, -15,
	-20, -10,   0,   5,   5,   0, -10, -20,
	-30, -20, -10,  -5,  -5, -10, -20, -30,
	-40, -30, -20, -15, -15, -20, -30, -40
};
static const int pcsq_bishop_op[64] =
{
	 -8,  -8,  -6,  -4,  -4,  -6,  -8,  -8,
	 -8,   0,  -2,   0,   0,  -2,   0,  -8,
	 -6,  -2,   4,   2,   2,   4,  -2,  -6,
	 -4,   0,   2,   8,   8,   2,   0,  -4,
	 -4,   0,   2,   8,   8,   2,   0,  -4,
	 -6,  -2,   4,   2,   2,   4,  -2,  -6,
	 -8,   0,  -2,   0,   0,  -2,   0,  -8,
	-18, -18, -16, -14, -14, -16, -18, -18
};
static const int pcsq_bishop_eg[64] =
{
	-18, -12,  -9,  -6,  -6,  -9, -12, -18,
	-12,  -6,  -3,   0,   0,  -3,  -6, -12,
	 -9,  -3,   0,   3,   3,   0,  -3,  -9,
	 -6,   0,   3,   6,   6,   3,   0,  -6,
	 -6,   0,   3,   6,   6,   3,   0,  -6,
	 -9,  -3,   0,   3,   3,   0,  -3,  -9,
	-12,  -6,  -3,   0,   0,  -3,  -6, -12,
	-18, -12,  -9,  -6,  -6,  -9, -12, -18
};
static const int pcsq_rook_op[64] =
{
	 -6,  -3,   0,   3,   3,   0,  -3,  -6,
	 -6,  -3,   0,   3,   3,   0,  -3,  -6,
	 -6,  -3,   0,   3,   3,   0,  -3,  -6,
	 -6,  -3,   0,   3,   3,   0,  -3,  -6,
	 -6,  -3,   0,   3,   3,   0,  -3,  -6,
	 -6,  -3,   0,   3,   3,   0,  -3,  -6,
	 -6,  -3,   0,   3,   3,   0,  -3,  -6,
	 -6,  -3,   0,   3,   3,   0,  -3,  -6
};
static const int pcsq_queen_op[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,   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,
	 -5,  -5,  -5,  -5,  -5,  -5,  -5,  -5
};
static const int pcsq_queen_eg[64] =
{
	-24, -16, -12,  -8,  -8, -12, -16, -24,
	-16,  -8,  -4,   0,   0,  -4,  -8, -16,
	-12,  -4,   0,   4,   4,   0,  -4, -12,
	 -8,   0,   4,   8,   8,   4,   0,  -8,
	 -8,   0,   4,   8,   8,   4,   0,  -8,
	-12,  -4,   0,   4,   4,   0,  -4, -12,
	-16,  -8,  -4,   0,   0,  -4,  -8, -16,
	-24, -16, -12,  -8,  -8, -12, -16, -24
};
static const int pcsq_king_op[64] =
{
	-40, -30, -50, -70, -70, -50, -30, -40,
	-30, -20, -40, -60, -60, -40, -20, -30,
	-20, -10, -30, -50, -50, -30, -10, -20,
	-10,   0, -20, -40, -40, -20,   0, -10,
	  0,  10, -10, -30, -30, -10,  10,   0,
	 10,  20,   0, -20, -20,   0,  20,  10,
	 30,  40,  20,   0,   0,  20,  40,  30,
	 40,  50,  30,  10,  10,  30,  50,  40
};
static const int pcsq_king_eg[64] =
{
	-72, -48, -36, -24, -24, -36, -48, -72,
	-48, -24, -12,   0,   0, -12, -24, -48,
	-36, -12,   0,  12,  12,   0, -12, -36,
	-24,   0,  12,  24,  24,  12,   0, -24,
	-24,   0,  12,  24,  24,  12,   0, -24,
	-36, -12,   0,  12,  12,   0, -12, -36,
	-48, -24, -12,   0,   0, -12, -24, -48,
	-72, -48, -36, -24, -24, -36, -48, -72
};
We already have two engines with this inside. I doubt we need 3.

Christopher
Top
Tony Thomas

Re: Toga 0.1.1 released

Post by Tony Thomas »

Christopher Conkie wrote:
Tony Thomas wrote:
Christopher Conkie wrote:
GenoM wrote:
Christopher Conkie wrote:
Jim Ablett wrote: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.
:D

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
};
static const int pcsq_knight_op[64] =
{
	-135,  -25,  -15,  -10,  -10,  -15,  -25, -135,
	 -20,  -10,    0,    5,    5,    0,  -10,  -20,
	  -5,    5,   15,   20,   20,   15,    5,   -5,
	  -5,    5,   15,   20,   20,   15,    5,   -5,
	 -10,    0,   10,   15,   15,   10,    0,  -10,
	 -20,  -10,    0,    5,    5,    0,  -10,  -20,
	 -35,  -25,  -15,  -10,  -10,  -15,  -25,  -35,
	 -50,  -40,  -30,  -25,  -25,  -30,  -40,  -50
};
static const int pcsq_knight_eg[64] =
{
	-40, -30, -20, -15, -15, -20, -30, -40,
	-30, -20, -10,  -5,  -5, -10, -20, -30,
	-20, -10,   0,   5,   5,   0, -10, -20,
	-15,  -5,   5,  10,  10,   5,  -5, -15,
	-15,  -5,   5,  10,  10,   5,  -5, -15,
	-20, -10,   0,   5,   5,   0, -10, -20,
	-30, -20, -10,  -5,  -5, -10, -20, -30,
	-40, -30, -20, -15, -15, -20, -30, -40
};
static const int pcsq_bishop_op[64] =
{
	 -8,  -8,  -6,  -4,  -4,  -6,  -8,  -8,
	 -8,   0,  -2,   0,   0,  -2,   0,  -8,
	 -6,  -2,   4,   2,   2,   4,  -2,  -6,
	 -4,   0,   2,   8,   8,   2,   0,  -4,
	 -4,   0,   2,   8,   8,   2,   0,  -4,
	 -6,  -2,   4,   2,   2,   4,  -2,  -6,
	 -8,   0,  -2,   0,   0,  -2,   0,  -8,
	-18, -18, -16, -14, -14, -16, -18, -18
};
static const int pcsq_bishop_eg[64] =
{
	-18, -12,  -9,  -6,  -6,  -9, -12, -18,
	-12,  -6,  -3,   0,   0,  -3,  -6, -12,
	 -9,  -3,   0,   3,   3,   0,  -3,  -9,
	 -6,   0,   3,   6,   6,   3,   0,  -6,
	 -6,   0,   3,   6,   6,   3,   0,  -6,
	 -9,  -3,   0,   3,   3,   0,  -3,  -9,
	-12,  -6,  -3,   0,   0,  -3,  -6, -12,
	-18, -12,  -9,  -6,  -6,  -9, -12, -18
};
static const int pcsq_rook_op[64] =
{
	 -6,  -3,   0,   3,   3,   0,  -3,  -6,
	 -6,  -3,   0,   3,   3,   0,  -3,  -6,
	 -6,  -3,   0,   3,   3,   0,  -3,  -6,
	 -6,  -3,   0,   3,   3,   0,  -3,  -6,
	 -6,  -3,   0,   3,   3,   0,  -3,  -6,
	 -6,  -3,   0,   3,   3,   0,  -3,  -6,
	 -6,  -3,   0,   3,   3,   0,  -3,  -6,
	 -6,  -3,   0,   3,   3,   0,  -3,  -6
};
static const int pcsq_queen_op[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,   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,
	 -5,  -5,  -5,  -5,  -5,  -5,  -5,  -5
};
static const int pcsq_queen_eg[64] =
{
	-24, -16, -12,  -8,  -8, -12, -16, -24,
	-16,  -8,  -4,   0,   0,  -4,  -8, -16,
	-12,  -4,   0,   4,   4,   0,  -4, -12,
	 -8,   0,   4,   8,   8,   4,   0,  -8,
	 -8,   0,   4,   8,   8,   4,   0,  -8,
	-12,  -4,   0,   4,   4,   0,  -4, -12,
	-16,  -8,  -4,   0,   0,  -4,  -8, -16,
	-24, -16, -12,  -8,  -8, -12, -16, -24
};
static const int pcsq_king_op[64] =
{
	-40, -30, -50, -70, -70, -50, -30, -40,
	-30, -20, -40, -60, -60, -40, -20, -30,
	-20, -10, -30, -50, -50, -30, -10, -20,
	-10,   0, -20, -40, -40, -20,   0, -10,
	  0,  10, -10, -30, -30, -10,  10,   0,
	 10,  20,   0, -20, -20,   0,  20,  10,
	 30,  40,  20,   0,   0,  20,  40,  30,
	 40,  50,  30,  10,  10,  30,  50,  40
};
static const int pcsq_king_eg[64] =
{
	-72, -48, -36, -24, -24, -36, -48, -72,
	-48, -24, -12,   0,   0, -12, -24, -48,
	-36, -12,   0,  12,  12,   0, -12, -36,
	-24,   0,  12,  24,  24,  12,   0, -24,
	-24,   0,  12,  24,  24,  12,   0, -24,
	-36, -12,   0,  12,  12,   0, -12, -36,
	-48, -24, -12,   0,   0, -12, -24, -48,
	-72, -48, -36, -24, -24, -36, -48, -72
};
We already have two engines with this inside. I doubt we need 3.

Christopher
I am sure that Ryan knows about the program better than you, and some eval weights arent going to change his opinion.
Top
Tony Thomas

Re: Toga 0.1.1 released

Post by Tony Thomas »

Ryan Benitez wrote:
I read his eval function and I my understanding is that because it is written in his own code he would not have to GPL it if he did not want to. I am happy he did choose to GPL the program though. Not because of Fruit but because it helps computer chess overall to have more GPL chess engines.

Ryan
Ilari Pihlajisto wrote:
Ryan Benitez wrote:I read his eval function and I my understanding is that because it is written in his own code he would not have to GPL it if he did not want to.
That would be a slippery slope though. Had I not decided to release under GPL, I probably wouldn't have examined Fruit's evaluation at all.

I am happy he did choose to GPL the program though. Not because of Fruit but because it helps computer chess overall to have more GPL chess engines.
I happy about it too.
You have to give props for this guys honesty and hardwork. Ofcourse, you can never appreciate that because you are on a team of your own.
Top
Christopher Conkie
Posts: 6074
Joined: Sat Apr 01, 2006 9:34 pm
Location: Scotland

Re: Toga 0.1.1 released

Post by Christopher Conkie »

Tony Thomas wrote: I am sure that Ryan knows about the program better than you, and some eval weights arent going to change his opinion.
I bet you have not asked him. I know different and so does the "author".

http://members.aon.at/josefd/Toga%20LOG.html

These are not "some"......these are ALL of them.

I dare you to get Ryan to say that these are not directly and exactly from Toga which IS Fruit.

If they were to be changed things might change. While he is doing that he might also want to change the Fruity search.

Until then..........its a clone.
Top
User avatar
geots
Posts: 4790
Joined: Sat Mar 11, 2006 12:42 am

Strelka & Sloppy Now in Wal-Mart !!

Post by geots »

Updated versions- while they last! 8-)
Top

Return to “Computer Chess Club: General Topics”