Little Goliath 3.15.3 ("Evolution") - Neural Network Version, UCI chess engine.
Author: Michael Borgstädt Rating CEDR=3036
Little Goliath ("Evolution") - Neural Network Version
The engine uses a neural network for positional evaluation. In direct
comparison with the old engine, which uses manually generated evaluation
functions, this engine achieves almost 100% in over 1000 test games (only
a few draw games). This is obviously significantly more than other
programmes have achieved when switching to neural networks.
However, it
does not seem to be due to the net itself but to its effect on a pruning
system, which I call "path finding pruning" and which seems to depend
essentially on an exact position evaluation. If this pruning is
deactivated in both engines, the NN version "only" wins with about 70%.
If I leave the pruning activated in the classic engine and play against
the same version without it, the version with pruning is only just ahead
(approx. 52%).
On fast hardware, this also corresponds to the results
from about 16 years ago. Consequently, the neural network or the more
exact positional evaluation seems to have an extreme effect here.
This is
an important approach for future programme versions, perhaps much more
can be achieved by tuning (also other techniques). Another effect is the
significantly lower search depth overall. Here, too, the network seems to
have an effect, the search is shallower, but more accurate. Again, it
will be an approach to pruning even more aggressively. I always thought
the pruning in Little Goliath was very aggressive.
However, when I look
at Stockfish, it doesn't come close to being aggressive either. I rejected
similar approaches at the time, because as a chess player I was of the
opinion that tactical variants are of decisive importance for the strength
of the game and that the pruning here should not be too intensive.
Obviously a misjudgement, which I will look at more closely.
In addition, "Sigular Extensions" are now activated by default.
This was not
the case before. Here, too, the net seems to have a positive effect. Since I
am often asked, here is the information that I use singular extensions in the
classic form. That is, as described by Hsu with regard to Deep Blue.
I have
only changed the conditions and considerably reduced the effort for testing
for singularity (at the expense of accuracy). The method of controlling
singular extensions via the hash tables, which is apparently used as
"state-of-the-art" today, was already tested by me 20 years ago in many
programme versions without success.
Even today, with a 1:1 implementation as
in Stockfish, I cannot achieve any improvement with Little Goliath (the
opposite is rather the case). Why this is so will certainly be the subject
of further investigation.
Apart from that, I have not made any changes. As I said, my initial aim is
to highlight the differences between the two versions (classic and NN).
Unfortunately, that's why all the bugs (there were some back then, I didn't
keep track) of the old version (from 2006) are still included then.
The engine is available as a 32-bit version, which should also run on old
hardware. There is also a 64-bit version that is about 25% faster.
A completely revised version will follow in a few weeks, then also with the
extended networks. I am personally very curious to see what will be possible here.
v.3.15.4:
Bugfix + small improvements
Little Goliath 3.15.4 download
Comments
Post a Comment