A generic, simple and fast implementation of Deepmind's AlphaZero
Beyond its much publicized success in attaining superhuman level at games such as Chess and Go, DeepMind's AlphaZero algorithm illustrates a more general methodology of combining learning and search to explore large combinatorial spaces effectively. We believe that this methodology can have exciting applications in many different research areas. Because AlphaZero is resource-hungry, successful open-source implementations (such as Leela Zero) are written in low-level languages (such as C++)...
...Thereby, if you try a gambit yourself, the program might
try to a counter-gambit (or sometimes an unconventional
line). It will play weak against other engines, and it not meant
as to play very strong/perfectly, but for human opponents, the gambit lines
will most often result in entertaining -not boring- games, and require
quite some concentration to avoid tactical mistakes.