Since you’re here...

We hope you will consider supporting us today. We need your support to continue to exist, because good entries are more and more work time. Every reader contribution, however big or small, is so valuable. Support "Chess Engines Diary" even a small amount– and it only takes a minute. Thank you.
============================== My email: jotes@go2.pl



Aconcagua 5.2.0 - new version chess engine

 


Aconcagua - UCI chess engine, written in Go
Author: Gabriel (gabtar)

Aconcagua 5.2.0 JA what's new?

This new release is focused mainly on improvements in time control. Aconcagua now uses an adaptive time control depending on the search complexity of the current position. There are also improvements to the evaluation function(hce) focused on threats and a new king safety evaluation. Search has also been improved. Finally, an old bug with threefold repetition was completely fixed.

As usual, improvement against previous version, Aconcagua v5.1.0 (fastchess match output):

STC 8+0.08 time control - 2000 Games
Results of Aconcagua-v5.2.0 vs Aconcagua-v5.1.0 (8+0.08, NULL, 64MB, UHO_Lichess_4852_v1.epd):
Elo: 145.54 +/- 12.33, nElo: 201.68 +/- 15.23
LOS: 100.00 %, DrawRatio: 27.90 %, PairsRatio: 7.10
Games: 2000, Wins: 1095, Losses: 303, Draws: 602, Points: 1396.0 (69.80 %)
Ptnml(0-2): [15, 74, 279, 368, 264], WL/DD Ratio: 2.49
LTC 60+0.6 time control - 2000 Games
Results of Aconcagua-v5.2.0 vs Aconcagua-v5.1.0 (60+0.6, NULL, 64MB, UHO_Lichess_4852_v1.epd):
Elo: 173.00 +/- 12.33, nElo: 250.98 +/- 15.23
LOS: 100.00 %, DrawRatio: 23.30 %, PairsRatio: 10.98
Games: 2000, Wins: 1139, Losses: 218, Draws: 643, Points: 1460.5 (73.02 %)
Ptnml(0-2): [8, 56, 233, 413, 290], WL/DD Ratio: 1.68
Changes
Detect attacks to an square using Square Attacked By, instead of iterating over all enemy pieces #21
Fix threefold repetition by counting only up to one repetition (this not worked properly) #22
New King Safety evaluation with Pawn Shield and Storm #23
Add threats evaluation (mayor pieces threated by minor pieces, threated by pawns, safe check threats) #24
Dynamic Time Control. Use soft/hard time limits for search while in tournament time controls. Adjust time spent on search based on the nodes searched at root moves #25
Depth dependent null move pruning reduction #26
Refactor history heuristic to use history gravity formula #27
Static exchange evaluation pruning in main search moves loop #29
Fix threefold repetition bug again(set en passant square 'only if' an enemy pawn is attacking it) #30
Included Binaries
Below, are available to download the compiled binaries for Linux, Windows and Mac OS, built using the GOAMD64(v1, v2, v3, v4) profile flag for specific x86_64 microarchitectures.
You can find more information about the supported instructions on each microarchitecture here
If you are not sure which one to pick, use the one with 'base' suffix, that uses instructions that all x86_64 cpus support.


Comments