Super Tournament XXX 1CPU

Discussion of computer chess matches and engine tournaments.

Moderators: bob, hgm, Harvey Williamson

Forum rules
This textbox is used to restore diagrams posted with the [d] tag before the upgrade.
User avatar
Graham Banks
Posts: 33141
Joined: Sun Feb 26, 2006 9:52 am
Location: Auckland, NZ

Super Tournament XXX 1CPU

Post by Graham Banks » Thu Mar 29, 2018 11:13 pm

SUPER TOURNAMENT XXX 1CPU

Intel i5 Quad
ChessGUI
256mb hash each where possible
3-4-5 piece tablebases
Ponder off
TWIC2018.cgb book
40 moves in 25 minutes repeating (adapted for the CCRL)
6 cycles 54 rounds


Participants

SugaR XPrO 250318 64-bit
ShashChess 1.0 64-bit
Stockfish 280318 64-bit
Houdini 6.03 64-bit
Komodo 11.3.1 64-bit
Fire 020718 64-bit
Deep Shredder 13 64-bit
Fizbo 2.0 64-bit
Andscacs 0.93 64-bit
Booot 6.2 64-bit

Image

Image

Image

Image

Image

Image

Image

Image

Image

Image
My email addresses:
gbanksnz at gmail.com
gbanksnz at yahoo.co.nz

User avatar
Graham Banks
Posts: 33141
Joined: Sun Feb 26, 2006 9:52 am
Location: Auckland, NZ

Broadcast Details

Post by Graham Banks » Thu Mar 29, 2018 11:15 pm

Games will be available for download after every six rounds from here:
http://kirill-kryukov.com/chess/discuss ... f=7&t=9867

Alternatively, if you install TLCV (Tom's Live Chess Viewer) on your computer, you can watch the games live move by move. You'll also be able to chat to others following the tournament in the chatroom there.
http://home.pacific.net.au/~tommyinoz/client.zip
Host - GrahamCCRL.dyndns.org Port - 16053
My email addresses:
gbanksnz at gmail.com
gbanksnz at yahoo.co.nz

Kohflote
Posts: 200
Joined: Wed Sep 19, 2007 9:07 am
Location: Singapore

Re: Broadcast Details

Post by Kohflote » Fri Mar 30, 2018 3:56 am

Hi Graham,

What is ShashChess? Where can we get more info on this engine?

Thank you & regards,
Koh, Kah Huat

User avatar
Graham Banks
Posts: 33141
Joined: Sun Feb 26, 2006 9:52 am
Location: Auckland, NZ

Re: Broadcast Details

Post by Graham Banks » Fri Mar 30, 2018 4:24 am

Kohflote wrote:Hi Graham,

What is ShashChess? Where can we get more info on this engine?

Thank you & regards,
Koh, Kah Huat
It is a private engine that uses Shashin theory.
My email addresses:
gbanksnz at gmail.com
gbanksnz at yahoo.co.nz

User avatar
Guenther
Posts: 3043
Joined: Wed Oct 01, 2008 4:33 am
Location: Regensburg, Germany
Full name: Guenther Simon
Contact:

Re: Broadcast Details

Post by Guenther » Fri Mar 30, 2018 7:14 am

From Zerbinati & friends with love.
From a funny Sugar fork into Sugar as Junior strategy again and then shashed ;-) How private can Stockfish become...?

https://github.com/Kozlov-Sergey-Aleksa ... axy-master

https://github.com/Zerbinati/SugaR/pull/64
https://github.com/Zerbinati/SugaR/pull/65

https://github.com/Zerbinati/SugaR/comm ... 8635529825
https://github.com/Zerbinati/SugaR/comm ... 8e0b4c15d5
https://github.com/Zerbinati/SugaR/comm ... 8e0b4c15d5

Code: Select all

#include "material.h"
 #include "material.h"
 #include "pawns.h"
 #include "pawns.h"
 
 
+#include "uci.h"
+
 std&#58;&#58;atomic<Score> Eval&#58;&#58;Contempt;
 std&#58;&#58;atomic<Score> Eval&#58;&#58;Contempt;
 
 
 namespace Trace &#123;
 namespace Trace &#123;
@@ -867,14 +869,18 @@ namespace &#123;
             + pieces<WHITE, ROOK  >() - pieces<BLACK, ROOK  >()
             + pieces<WHITE, ROOK  >() - pieces<BLACK, ROOK  >()
             + pieces<WHITE, QUEEN >() - pieces<BLACK, QUEEN >();
             + pieces<WHITE, QUEEN >() - pieces<BLACK, QUEEN >();
 
 
-    score += mobility&#91;WHITE&#93; - mobility&#91;BLACK&#93;;
+	if&#40;Options&#91;"Junior Mobility"&#93;)
-
+		score += mobility&#91;WHITE&#93; - mobility&#91;BLACK&#93;;
-    score +=  king<   WHITE>() - king<   BLACK>()
+	if &#40;Options&#91;"Junior King"&#93;)
-            + threats<WHITE>() - threats<BLACK>()
+		score += king<   WHITE>() - king<   BLACK>();
-            + passed< WHITE>() - passed< BLACK>()
+	if &#40;Options&#91;"Junior Threats"&#93;)
-            + space<  WHITE>() - space<  BLACK>();
+		score += threats<WHITE>() - threats<BLACK>();
-
+	if &#40;Options&#91;"Junior Passed"&#93;)
-    score += initiative&#40;eg_value&#40;score&#41;);
+		score += passed< WHITE>() - passed< BLACK>();
+	if &#40;Options&#91;"Junior Space"&#93;)
+		score += space<  WHITE>() - space<  BLACK>();
+	if &#40;Options&#91;"Junior Initiative"&#93;)
+		score += initiative&#40;eg_value&#40;score&#41;);
 
 
     // Interpolate between a middlegame and a &#40;scaled by 'sf') endgame score
     // Interpolate between a middlegame and a &#40;scaled by 'sf') endgame score
     ScaleFactor sf = scale_factor&#40;eg_value&#40;score&#41;);
     ScaleFactor sf = scale_factor&#40;eg_value&#40;score&#41;);
8 source/ucioption.cpp
@@ -90,7 +90,13 @@ void init&#40;OptionsMap& o&#41; &#123;
   o&#91;"Minimum Thinking Time"&#93; << Option&#40;20, 0, 5000&#41;;
   o&#91;"Minimum Thinking Time"&#93; << Option&#40;20, 0, 5000&#41;;
   o&#91;"Slow Mover"&#93;            << Option&#40;84, 10, 1000&#41;;
   o&#91;"Slow Mover"&#93;            << Option&#40;84, 10, 1000&#41;;
   o&#91;"nodestime"&#93;             << Option&#40;0, 0, 10000&#41;;
   o&#91;"nodestime"&#93;             << Option&#40;0, 0, 10000&#41;;
-  o&#91;"Junior Depth"&#93;			 << Option&#40;MAX_PLY-1, 1, MAX_PLY-1&#41;;
+  o&#91;"Junior Depth"&#93;					<< Option&#40;MAX_PLY-1, 1, MAX_PLY-1&#41;;
+  o&#91;"Junior Mobility"&#93;				<< Option&#40;true&#41;;
+  o&#91;"Junior King"&#93;					<< Option&#40;true&#41;;
+  o&#91;"Junior Threats"&#93;				<< Option&#40;true&#41;;
+  o&#91;"Junior Passed"&#93;				<< Option&#40;true&#41;;
+  o&#91;"Junior Space"&#93;					<< Option&#40;true&#41;;
+  o&#91;"Junior Initiative"&#93;			<< Option&#40;true&#41;;
   o&#91;"NeverClearHash"&#93;           << Option&#40;false&#41;;
   o&#91;"NeverClearHash"&#93;           << Option&#40;false&#41;;
   o&#91;"HashFile"&#93;                 << Option&#40;"SugaR_hash.hsh", on_HashFile&#41;;
   o&#91;"HashFile"&#93;                 << Option&#40;"SugaR_hash.hsh", on_HashFile&#41;;
   o&#91;"SaveHashtoFile"&#93;           << Option&#40;SaveHashtoFile&#41;;
   o&#91;"SaveHashtoFile"&#93;           << Option&#40;SaveHashtoFile&#41;;
0 comments on commit f63818f

Code: Select all

Change with Original name "Shashin"

    master (#36&#41; 

    Dev_12 

@Zerbinati
Zerbinati committed 8 days ago
1 parent 3c3bb63 commit 6d383a7e536de933f319a1c2a237158e0b4c15d5
Showing
with 68 additions and 68 deletions.
84 source/evaluate.cpp
@@ -31,14 +31,14 @@
 
 
 #include "uci.h"
 #include "uci.h"
 
 
-extern int Options_Junior_Depth;
+extern int Options_Shashin_Depth;
-extern bool Options_Junior_Mobility;
+extern bool Options_Shashin_Mobility;
-extern bool Options_Junior_King;
+extern bool Options_Shashin_King;
-extern bool Options_Junior_Threats;
+extern bool Options_Shashin_Threats;
-extern bool Options_Junior_Passed;
+extern bool Options_Shashin_Passed;
-extern bool Options_Junior_Space;
+extern bool Options_Shashin_Space;
-extern bool Options_Junior_Initiative;
+extern bool Options_Shashin_Initiative;
-extern bool Options_Junior_Strategy;
+extern bool Options_Shashin_Strategy;
 
 
 std&#58;&#58;atomic<Score> Eval&#58;&#58;Contempt;
 std&#58;&#58;atomic<Score> Eval&#58;&#58;Contempt;
 
 
@@ -873,66 +873,66 @@ namespace &#123;
             + pieces<WHITE, ROOK  >() - pieces<BLACK, ROOK  >()
             + pieces<WHITE, ROOK  >() - pieces<BLACK, ROOK  >()
             + pieces<WHITE, QUEEN >() - pieces<BLACK, QUEEN >();
             + pieces<WHITE, QUEEN >() - pieces<BLACK, QUEEN >();
 
 
-	Value v_Junior_test = v;
+	Value v_Shashin_test = v;
 	
 	
-	constexpr double JUNIOR_WINNING_PAWNS_COUNT = 2.0;
+	constexpr double SHASHIN_WINNING_PAWNS_COUNT = 2.0;
-	const Value JUNIOR_WINNING_VALUE = Value&#40;int&#40;JUNIOR_WINNING_PAWNS_COUNT*double&#40;PawnValueMg + PawnValueEg&#41;/2.0&#41;);
+	const Value SHASHIN_WINNING_VALUE = Value&#40;int&#40;SHASHIN_WINNING_PAWNS_COUNT*double&#40;PawnValueMg + PawnValueEg&#41;/2.0&#41;);
-	constexpr double Junior_Scale_Factor_Default = 1.0;
+	constexpr double Shashin_Scale_Factor_Default = 1.0;
-	constexpr double Junior_Winning_Scale_Factor_Default = 0.1;
+	constexpr double Shashin_Winning_Scale_Factor_Default = 0.1;
-	constexpr double Junior_Scale_Factor_Bonus_Default = 2.0 / double&#40;MidgameLimit + EndgameLimit&#41; * Junior_Winning_Scale_Factor_Default;
+	constexpr double Shashin_Scale_Factor_Bonus_Default = 2.0 / double&#40;MidgameLimit + EndgameLimit&#41; * Shashin_Winning_Scale_Factor_Default;
-	const double Junior_Scale_Factor_Bonus = &#40;double&#40;v_Junior_test&#41; / double&#40;JUNIOR_WINNING_VALUE&#41; - 1.0&#41; * Junior_Scale_Factor_Bonus_Default;
+	const double Shashin_Scale_Factor_Bonus = &#40;double&#40;v_Shashin_test&#41; / double&#40;SHASHIN_WINNING_VALUE&#41; - 1.0&#41; * Shashin_Scale_Factor_Bonus_Default;
-
+
-	double mobility_Junior_scale = Junior_Scale_Factor_Default;
+	double mobility_Shashin_scale = Shashin_Scale_Factor_Default;
-	double king_Junior_scale = Junior_Scale_Factor_Default;
+	double king_Shashin_scale = Shashin_Scale_Factor_Default;
-	double threats_Junior_scale = Junior_Scale_Factor_Default;
+	double threats_Shashin_scale = Shashin_Scale_Factor_Default;
-	double passed_Junior_scale = Junior_Scale_Factor_Default;
+	double passed_Shashin_scale = Shashin_Scale_Factor_Default;
-	double space_Junior_scale = Junior_Scale_Factor_Default;
+	double space_Shashin_scale = Shashin_Scale_Factor_Default;
-	double initiative_Junior_scale = Junior_Scale_Factor_Default;
+	double initiative_Shashin_scale = Shashin_Scale_Factor_Default;
-
+
-	if &#40;Options_Junior_Strategy&#41;
+	if &#40;Options_Shashin_Strategy&#41;
 	&#123;
 	&#123;
-		mobility_Junior_scale = Junior_Scale_Factor_Default - Junior_Scale_Factor_Bonus;
+		mobility_Shashin_scale = Shashin_Scale_Factor_Default - Shashin_Scale_Factor_Bonus;
-		king_Junior_scale = Junior_Scale_Factor_Default + Junior_Scale_Factor_Bonus;
+		king_Shashin_scale = Shashin_Scale_Factor_Default + Shashin_Scale_Factor_Bonus;
-		threats_Junior_scale = Junior_Scale_Factor_Default - Junior_Scale_Factor_Bonus;
+		threats_Shashin_scale = Shashin_Scale_Factor_Default - Shashin_Scale_Factor_Bonus;
-		passed_Junior_scale = Junior_Scale_Factor_Default + Junior_Scale_Factor_Bonus;
+		passed_Shashin_scale = Shashin_Scale_Factor_Default + Shashin_Scale_Factor_Bonus;
-		space_Junior_scale = Junior_Scale_Factor_Default + Junior_Scale_Factor_Bonus;
+		space_Shashin_scale = Shashin_Scale_Factor_Default + Shashin_Scale_Factor_Bonus;
-		initiative_Junior_scale = Junior_Scale_Factor_Default - Junior_Scale_Factor_Bonus;
+		initiative_Shashin_scale = Shashin_Scale_Factor_Default - Shashin_Scale_Factor_Bonus;
 	&#125;
 	&#125;
 
 
-	if &#40;Options_Junior_Mobility&#41;
+	if &#40;Options_Shashin_Mobility&#41;
 	&#123;
 	&#123;
 		Score default_mobility = mobility&#91;WHITE&#93; - mobility&#91;BLACK&#93;;
 		Score default_mobility = mobility&#91;WHITE&#93; - mobility&#91;BLACK&#93;;
-		Score score_mobility = Score&#40;int&#40;double&#40;default_mobility&#41;*mobility_Junior_scale&#41;);
+		Score score_mobility = Score&#40;int&#40;double&#40;default_mobility&#41;*mobility_Shashin_scale&#41;);
 		score += score_mobility;
 		score += score_mobility;
 	&#125;
 	&#125;
-	if &#40;Options_Junior_King&#41;
+	if &#40;Options_Shashin_King&#41;
 	&#123;
 	&#123;
 		Score default_king = king<   WHITE>() - king<   BLACK>();
 		Score default_king = king<   WHITE>() - king<   BLACK>();
-		Score score_king = Score&#40;int&#40;double&#40;default_king&#41;*king_Junior_scale&#41;);
+		Score score_king = Score&#40;int&#40;double&#40;default_king&#41;*king_Shashin_scale&#41;);
 		score += score_king;
 		score += score_king;
 	&#125;
 	&#125;
-	if &#40;Options_Junior_Threats&#41;
+	if &#40;Options_Shashin_Threats&#41;
 	&#123;
 	&#123;
 		Score default_threades = threats<WHITE>() - threats<BLACK>();
 		Score default_threades = threats<WHITE>() - threats<BLACK>();
-		Score score_threats = Score&#40;int&#40;double&#40;default_threades&#41;*threats_Junior_scale&#41;);
+		Score score_threats = Score&#40;int&#40;double&#40;default_threades&#41;*threats_Shashin_scale&#41;);
 		score += score_threats;
 		score += score_threats;
 	&#125;
 	&#125;
-	if &#40;Options_Junior_Passed&#41;
+	if &#40;Options_Shashin_Passed&#41;
 	&#123;
 	&#123;
 		Score default_passed = passed< WHITE>() - passed< BLACK>();
 		Score default_passed = passed< WHITE>() - passed< BLACK>();
-		Score score_passed = Score&#40;int&#40;double&#40;default_passed&#41;*passed_Junior_scale&#41;);
+		Score score_passed = Score&#40;int&#40;double&#40;default_passed&#41;*passed_Shashin_scale&#41;);
 		score += score_passed;
 		score += score_passed;
 	&#125;
 	&#125;
-	if &#40;Options_Junior_Space&#41;
+	if &#40;Options_Shashin_Space&#41;
 	&#123;
 	&#123;
 		Score default_space = space<  WHITE>() - space<  BLACK>();
 		Score default_space = space<  WHITE>() - space<  BLACK>();
-		Score score_space = Score&#40;int&#40;double&#40;default_space&#41;*space_Junior_scale&#41;);
+		Score score_space = Score&#40;int&#40;double&#40;default_space&#41;*space_Shashin_scale&#41;);
 		score += score_space;
 		score += score_space;
 	&#125;
 	&#125;
-	if &#40;Options_Junior_Initiative&#41;
+	if &#40;Options_Shashin_Initiative&#41;
 	&#123;
 	&#123;
 		Score default_initiative = initiative&#40;eg_value&#40;score&#41;);
 		Score default_initiative = initiative&#40;eg_value&#40;score&#41;);
-		Score score_initiative = Score&#40;int&#40;double&#40;default_initiative&#41;*initiative_Junior_scale&#41;);
+		Score score_initiative = Score&#40;int&#40;double&#40;default_initiative&#41;*initiative_Shashin_scale&#41;);
 		score += score_initiative;
 		score += score_initiative;
 	&#125;
 	&#125;
 
 
34 source/search.cpp
@@ -40,15 +40,15 @@
 #include "uci.h"
 #include "uci.h"
 #include "syzygy/tbprobe.h"
 #include "syzygy/tbprobe.h"
 
 
-int Options_Junior_Depth;
+int Options_Shashin_Depth;
-bool Options_Junior_Mobility;
+bool Options_Shashin_Mobility;
-bool Options_Junior_King;
+bool Options_Shashin_King;
-bool Options_Junior_Threats;
+bool Options_Shashin_Threats;
-bool Options_Junior_Passed;
+bool Options_Shashin_Passed;
-bool Options_Junior_Space;
+bool Options_Shashin_Space;
-bool Options_Junior_Initiative;
+bool Options_Shashin_Initiative;
 
 
-bool Options_Junior_Strategy;
+bool Options_Shashin_Strategy;
 
 
 namespace Search &#123;
 namespace Search &#123;
 
 
@@ -231,15 +231,15 @@ void MainThread&#58;&#58;search&#40;) &#123;
   doNull   = Options&#91;"NullMove"&#93;;
   doNull   = Options&#91;"NullMove"&#93;;
   tactical =  Options&#91;"Analysis Mode"&#93;;
   tactical =  Options&#91;"Analysis Mode"&#93;;
 
 
-  Options_Junior_Depth = Options&#91;"Junior Depth"&#93;;
+  Options_Shashin_Depth = Options&#91;"Shashin Depth"&#93;;
-  Options_Junior_Mobility = Options&#91;"Junior Mobility"&#93;;
+  Options_Shashin_Mobility = Options&#91;"Shashin Mobility"&#93;;
-  Options_Junior_King = Options&#91;"Junior King"&#93;;
+  Options_Shashin_King = Options&#91;"Shashin King"&#93;;
-  Options_Junior_Threats = Options&#91;"Junior Threats"&#93;;
+  Options_Shashin_Threats = Options&#91;"Shashin Threats"&#93;;
-  Options_Junior_Passed = Options&#91;"Junior Passed"&#93;;
+  Options_Shashin_Passed = Options&#91;"Shashin Passed"&#93;;
-  Options_Junior_Space = Options&#91;"Junior Space"&#93;;
+  Options_Shashin_Space = Options&#91;"Shashin Space"&#93;;
-  Options_Junior_Initiative = Options&#91;"Junior Initiative"&#93;;
+  Options_Shashin_Initiative = Options&#91;"Shashin Initiative"&#93;;
 
 
-  Options_Junior_Strategy = Options&#91;"Junior Strategy"&#93;;
+  Options_Shashin_Strategy = Options&#91;"Shashin Strategy"&#93;;
  
  
   if &#40;rootMoves.empty&#40;))
   if &#40;rootMoves.empty&#40;))
   &#123;
   &#123;
@@ -390,7 +390,7 @@ void Thread&#58;&#58;search&#40;) &#123;
 
 
   // Iterative deepening loop until requested to stop or the target depth is reached
   // Iterative deepening loop until requested to stop or the target depth is reached
   while (   &#40;rootDepth += ONE_PLY&#41; < DEPTH_MAX
   while (   &#40;rootDepth += ONE_PLY&#41; < DEPTH_MAX
-	     && rootDepth <= Options_Junior_Depth
+	     && rootDepth <= Options_Shashin_Depth
          && !Threads.stop
          && !Threads.stop
          && !&#40;Limits.depth && mainThread && rootDepth / ONE_PLY > Limits.depth&#41;)
          && !&#40;Limits.depth && mainThread && rootDepth / ONE_PLY > Limits.depth&#41;)
   &#123;
   &#123;
2 source/uci.cpp
@@ -305,7 +305,7 @@ string UCI&#58;&#58;move&#40;Move m, bool chess960&#41; &#123;
 
 
 Move UCI&#58;&#58;to_move&#40;const Position& pos, string& str&#41; &#123;
 Move UCI&#58;&#58;to_move&#40;const Position& pos, string& str&#41; &#123;
 
 
-  if &#40;str.length&#40;) == 5&#41; // Junior could send promotion piece in uppercase
+  if &#40;str.length&#40;) == 5&#41; // Shashin could send promotion piece in uppercase
       str&#91;4&#93; = char&#40;tolower&#40;str&#91;4&#93;));
       str&#91;4&#93; = char&#40;tolower&#40;str&#91;4&#93;));
 
 
   for &#40;const auto& m &#58; MoveList<LEGAL>&#40;pos&#41;)
   for &#40;const auto& m &#58; MoveList<LEGAL>&#40;pos&#41;)
16 source/ucioption.cpp
@@ -90,14 +90,14 @@ void init&#40;OptionsMap& o&#41; &#123;
   o&#91;"Minimum Thinking Time"&#93; << Option&#40;20, 0, 5000&#41;;
   o&#91;"Minimum Thinking Time"&#93; << Option&#40;20, 0, 5000&#41;;
   o&#91;"Slow Mover"&#93;            << Option&#40;84, 10, 1000&#41;;
   o&#91;"Slow Mover"&#93;            << Option&#40;84, 10, 1000&#41;;
   o&#91;"nodestime"&#93;             << Option&#40;0, 0, 10000&#41;;
   o&#91;"nodestime"&#93;             << Option&#40;0, 0, 10000&#41;;
-  o&#91;"Junior Depth"&#93;					<< Option&#40;MAX_PLY-1, 1, MAX_PLY-1&#41;;
+  o&#91;"Shashin Depth"&#93;				<< Option&#40;MAX_PLY-1, 1, MAX_PLY-1&#41;;
-  o&#91;"Junior Mobility"&#93;				<< Option&#40;true&#41;;
+  o&#91;"Shashin Mobility"&#93;				<< Option&#40;true&#41;;
-  o&#91;"Junior King"&#93;					<< Option&#40;true&#41;;
+  o&#91;"Shashin King"&#93;					<< Option&#40;true&#41;;
-  o&#91;"Junior Threats"&#93;				<< Option&#40;true&#41;;
+  o&#91;"Shashin Threats"&#93;				<< Option&#40;true&#41;;
-  o&#91;"Junior Passed"&#93;				<< Option&#40;true&#41;;
+  o&#91;"Shashin Passed"&#93;				<< Option&#40;true&#41;;
-  o&#91;"Junior Space"&#93;					<< Option&#40;true&#41;;
+  o&#91;"Shashin Space"&#93;				<< Option&#40;true&#41;;
-  o&#91;"Junior Initiative"&#93;			<< Option&#40;true&#41;;
+  o&#91;"Shashin Initiative"&#93;			<< Option&#40;true&#41;;
-  o&#91;"Junior Strategy"&#93;					<< Option&#40;true&#41;;
+  o&#91;"Shashin Strategy"&#93;				<< Option&#40;true&#41;;
   o&#91;"NeverClearHash"&#93;           << Option&#40;false&#41;;
   o&#91;"NeverClearHash"&#93;           << Option&#40;false&#41;;
   o&#91;"HashFile"&#93;                 << Option&#40;"SugaR_hash.hsh", on_HashFile&#41;;
   o&#91;"HashFile"&#93;                 << Option&#40;"SugaR_hash.hsh", on_HashFile&#41;;
   o&#91;"SaveHashtoFile"&#93;           << Option&#40;SaveHashtoFile&#41;;
   o&#91;"SaveHashtoFile"&#93;           << Option&#40;SaveHashtoFile&#41;;
0 comments on commit 6d383a7
Current foe list count : [97]
http://rwbc-chess.de/chronology.htm

User avatar
Graham Banks
Posts: 33141
Joined: Sun Feb 26, 2006 9:52 am
Location: Auckland, NZ

Re: Broadcast Details

Post by Graham Banks » Fri Mar 30, 2018 7:26 am

My name is Andrea Manzo.
I 'm an ICCF International Chess Master, computer science engineer and
chess programmer.
I wrote the Vitruvius opening book

(http://www.vitruviuschess.com/About-Us.html)

and developed a private chess engine based on Alexander Shashin theory: ShashChess.


Private and closed source.
Not being tested for the rating list at this stage.

One interesting feature is that it has Tal, Botvinnik and Petrosian personality settings.
My email addresses:
gbanksnz at gmail.com
gbanksnz at yahoo.co.nz

User avatar
Guenther
Posts: 3043
Joined: Wed Oct 01, 2008 4:33 am
Location: Regensburg, Germany
Full name: Guenther Simon
Contact:

Re: Broadcast Details

Post by Guenther » Fri Mar 30, 2018 7:34 am

Graham Banks wrote:My name is Andrea Manzo.
I 'm an ICCF International Chess Master, computer science engineer and
chess programmer.
I wrote the Vitruvius opening book

(http://www.vitruviuschess.com/About-Us.html)

and developed a private chess engine based on Alexander Shashin theory: ShashChess.


Private and closed source.
Not being tested for the rating list at this stage.

One interesting feature is that it has Tal, Botvinnik and Petrosian personality settings.
Well Vitruvius as connection is no good advertising...
Also funny that it comes with that 'Shashin' stuff, which was just
tested in Zerbinatis Sugar.
Even an aprils fool would have been better IMHO.
I smell another big rat.
Current foe list count : [97]
http://rwbc-chess.de/chronology.htm

amchess
Posts: 49
Joined: Tue Dec 05, 2017 1:42 pm

Re: Broadcast Details

Post by amchess » Fri Mar 30, 2018 5:39 pm

ShashChess isn't at all an April Fool.
I worked on Shashin's theory actively since 2011, based on various internet chess forums.
In particular, based on it, I realized the Vitruvius chess engine opening book (http://www.vitruviuschess.com/article/T ... uvius.html)
When the related book came out (https://www.amazon.com/Best-Play-Method ... 1936277468)
I began working hard also on implementing this on a real chess engine.
To verify this work, I choosed an engine derived from various open source code.
My part is original and meaningful as proved by
- a similar test (well less than the crucial 60%)
- a match against the latest best Stockfish, on 80 games based on a very good test suite based on all center types. The match was won by 7-0 in blitz (5 min) mode
- a test suite of very hard positions: ShashChess solved 282/438 of them. Based on my information, no other known engine can do that.
This last result can be improved using the algorithm options and position types.
"Tal, Capablanca and Petrosian" are in fact the very kernel of Shashin theory. If not, this is a simple non-sense.
The engine dynamically changes his search and evaluation based on the position type.
With the options, you can force them.
To determine the position type and to have an analysis in natural language of a position according to Shashin's theory, I also developed an AI NLG application (a virtual trainer).
I can't render all open source because of the commercial contract with my old and yet current publisher.
So, the engine is private.
If someone is interested, he can contact me privately: the Shashin code can improve all engines and I will be very happy to collaborate with someone.

Andrea Manzo

User avatar
Guenther
Posts: 3043
Joined: Wed Oct 01, 2008 4:33 am
Location: Regensburg, Germany
Full name: Guenther Simon
Contact:

Re: Broadcast Details

Post by Guenther » Fri Mar 30, 2018 6:08 pm

amchess wrote: - a match against the latest best Stockfish, on 80 games based on a very good test suite based on all center types. The match was won by 7-0 in blitz (5 min) mode

Andrea Manzo
Where have I seen this already, also the sim test in advance? ;-)
Greets to Munter
Current foe list count : [97]
http://rwbc-chess.de/chronology.htm

User avatar
Zerbinati
Posts: 61
Joined: Mon Aug 18, 2014 5:12 pm
Location: Trento (Italy)

Re: Broadcast Details

Post by Zerbinati » Fri Mar 30, 2018 7:31 pm

Guenther wrote:From Zerbinati & friends with love.
From a funny Sugar fork into Sugar as Junior strategy again and then shashed ;-) How private can Stockfish become...?
Dear Simon
It is not difficult to notice that you talk a lot .. but I do not think you have shown that you understand anything about programming.
Fortunately, this prestigious forum is attended by people much more competent than you.
It will not be difficult for them to analyze the SugaR code and understand
that the first part of Junior aims to select the game strength
"Junior Options Added."
Added options let enable and disable some of static evaluation (strategy options) to let people play with their level of program.. "Junior Depth" option limits tactics for the same ability. The options let to limit strength of the engine with tactic and strategy.
https://github.com/Zerbinati/SugaR/comm ... 17a43b7033

As for the Shashin code present in SugaR
it is a spontaneous interpretation of the theory of my co-author
Kozlov Sergey Aleksandrovitch
I define it as an interpretation because it can be noted that the algorithms for evaluating and recognizing positions like Tal, Petrosian and Capablanca are not present.
The reason why part of the code was renamed from Junior to Sashin
and it will most likely return all Junior and just to test the efficiency of the engine, to understand just how much the two variables affect the actual game by reporting the same name or different names.

I do not think it's a crime to understand if the names of different variables can affect the strength of the game do not you think?

I end with a personal thought ..
It would be nice to see you intervene at least once here in the forum, simply for the purpose of confronting you, but perhaps I ask too much to your character. :)

Post Reply