Full access to the folder with chess engines - about 3000 files!

If you do not want to wait a long time for download - donate a minimum of 10$, enter your email - you will gain full access to the folder with chess engines

Bonus on donate of $ 15 - access to the folder with games, tables and PDF files
Or transfer bank:
IBAN: PL 58 2490 0005 0000 4000 2134 5302 SWIFT code of the bank: ALBPPLPW Name of bank: Alior Bank
Bank address: Lupuszanska 38D, 02-232 Warsaw Bank Country: Poland Postscript: donation - chess engines (and email)

List of donors

Thursday, September 21, 2017

Raubfisch ME262 GTZ15 wins JCER Test Tournament, 2017.09.14 - 2017.09.18

Temp 3' + 3" Hardware: Intel Core i3-3217U CPU 3,9 GB Memory , Windows 10 x64
480 Tournament games, GUI-Arena 3.5.1161.651 JCER games,  until 31.12.2016
45.406 JCER games (from 01.01.2017)  JCER League
Book: Perfect 2017,   Table created - Scid vs PC

Shark 170917bf (has Cerebellum book integrated in exe file.)

Previous version chess engine Shark 

Rating JCER=3395

Shark 170917bf download

Texel 1.07a35 - UCI Chess engine. New version

Texel - UCI Chess engines

Author - Peter Osterlund

Rating JCER=2979 (19 place in Super League)

Texel 1.07a35 download

Stockfish 17091710 - new version!

Stockfish, chess engine UCI

Rating JCER = 3427
🔬 Author: Syzygy 

Timestamp: 1505637850 

Let ss->ply denote the number of plies from the root to the current node 

This patch lets ss->ply be equal to 0 at the root of the search. 

Currently, the root has ss->ply == 1, which is less intuitive: 

- Setting the rootNode bool has to check (ss-1)->ply == 0. 

- All mate values are off by one: the code seems to assume that mated-in-0 
is -VALUE_MATE, mate-1-in-ply is VALUE_MATE-1, mated-in-2-ply is VALUE_MATE+2, etc. 
But the mate_in() and mated_in() functions are called with ss->ply, which is 1 in 
at the root. 

- The is_draw() function currently needs to explain why it has "ply - 1 > i" instead 
of simply "ply > i". 

- The ss->ply >= MAX_PLY tests in search() and qsearch() already assume that 
ss->ply == 0 at the root. If we start at ss->ply == 1, it would make more sense to 
go up to and including ss->ply == MAX_PLY, so stop at ss->ply > MAX_PLY. See also 
the asserts testing for 0 <= ss->ply && ss->ply < MAX_PLY. 

The reason for ss->ply == 1 at the root is the line "ss->ply = (ss-1)->ply + 1" at 
the start for search() and qsearch(). By replacing this with "(ss+1)->ply = ss->ply + 1" 
we keep ss->ply == 0 at the root. Note that search() already clears killers in (ss+2), 
so there is no danger in accessing ss+1. 

I have NOT changed pv[MAX_PLY + 1] to pv[MAX_PLY + 2] in search() and qsearch(). 
It seems to me that MAX_PLY + 1 is exactly right: 

- MAX_PLY entries for ss->ply running from 0 to MAX_PLY-1, and 1 entry for the 
final MOVE_NONE. 

I have verified that mate scores are reported correctly. (They were already reported 
correctly due to the extra ply being rounded down when converting to moves.) 

The value of seldepth output to the user should probably not change, so I add 1 to it. 
(Humans count from 1, computers from 0.) 

A small optimisation I did not include: instead of setting ss->ply in every invocation 
of search() and qsearch(), it could be set once for all plies at the start of 
Thread::search(). This saves a couple of instructions per node. 

No functional change (unless the search searches a branch MAX_PLY deep), so bench 
does not change. 

⭐⭐⭐   Stockfish 17091710 - download

Orka 170917 (Stockfish clone) - new version

Previous version chess engine Orka 

Rating JCER=3367

Orka 170917 - download

Stockfish 17091710 - new version!

Stockfish, chess engine UCI

Rating JCER = 3427
🔬 Author: Stéphane Nicolet 

Timestamp: 1505634747 
Score unopposed weak pawns only if majors 

Do not use the opposed flag for scoring backward and isolated pawns 
in pawns.cpp, instead give a S(5,25) bonus for each opponent unopposed 
weak pawns when we have a rook or a queen on the board. 

STC run stopped after 113188 games: 
LLR: 1.63 (-2.94,2.94) [0.00,5.00] 
Total: 113188 W: 20804 L: 20251 D: 72133 

LLR: 2.95 (-2.94,2.94) [0.00,5.00] 
Total: 66673 W: 8672 L: 8341 D: 49660 

This is Alain Savard's idea, just with a different bonus. 
Bench: 6259498 

Nemorino 3.04 - UCI chess engine. New version!

Nemorino - UCI chess engine

Author - Christian Günther
Home page

Rating JCER=2901

Nemorino 3.04 download

Wednesday, September 20, 2017