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



Eleanor 1.0 - new version chess engine

on


Eleanor - a chess engine written in C++
Author: Mark (rektdie)

Eleanor Chess Engine

Search Features
Negamax
Quiescent Search
Transposition Table
Move Ordering (TT, SEE + MVV-LVA, Killers, History)
Iterative Deepening
Aspiration Windows
Principal Variation Search
Reverse Futility Pruning
Improving
Null Move Pruning
Late Move Reductions
Log formula
Cutnode
History
Late Move Pruning
Futility Pruning
QS SEE Pruning
PVS SEE Pruning

Evaluation
Eleanor uses a fully neural network-based evaluation function, entirely trained on self-play data from an initially simple HCE using the bullet trainer.
Architecture: (768 -> 256)x2 -> 1x8
A basic 256-hidden-layer perspective net with 8 output buckets.

The engine can be used in any GUI with UCI support.



Comments

Post a Comment