-
InfluxDB
Power Real-Time Data Analytics at Scale. Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality.
-
SaaSHub
SaaSHub - Software Alternatives and Reviews. SaaSHub helps you find the best software and product alternatives
In any case, you can try https://github.com/emdio/secondchess It's written in C, but (hopefully) quite easy to understand/modify.
If you are open to programs in non-python, my recommendations would be to look into https://github.com/AndyGrant/Ethereal which is written in C, cleaner and easier to understand than SF, and not too much weaker.
Another option in C++ is https://github.com/Luecx/Koivisto which is the youngest entrant into the top 10 and from what I recall has a lot of comments and is pretty clean.
I suspect in a PUCTS based engine, simply changing the parameters to make the search wider could have the effect you want. Ie, the engine will try losing moves more often, which reduces the expected value of a node if it doesn't have a lot of similar options. I haven't checked Leela out in a while, but there is a good chance you don't even need to modify code to try that. https://github.com/LeelaChessZero/lc0