glinscott

7 ms·

31.
Modern LZ Compression(glinscott.github.io)
1 points by glinscott 8y ago|0 comments
32.
by glinscott 8y ago
MCTS is not a traditional depth first minimax framework. Key concepts like alpha-beta don’t apply. Although it is proven to converge to minimax in the limit, the game trees are so large this is not relevant. You could use the network in
33.
by glinscott 8y ago
James put together a really nice summary of the ideas and the projects! It was almost a year ago that lc0 was launched, since then the community (led by Alexander Lyashuk, author of the current engine) has taken it to a totally different le
34.
by glinscott 8y ago
If you are interested in compression at all, be sure to take a trip through Charles Bloom's blog [1]. It's an incredible read, he covers everything from the basics all the way through state of the art algorithms. A great example
35.
by glinscott 9y ago
We are going to start tabula rasa. The supervised learning is meant to prove that there are no major bugs in the framework/learning process. Should be fun to watch it learn chess theory :).
36.
by glinscott 9y ago
Check out https://github.com/glinscott/leela-chess . We are getting close to kicking off the distributed version now that we have validated it's possible to get a strong network through supervised training. A nice
37.
by glinscott 9y ago
We are using data from both human grandmaster games and self-play games of a recent Stockfish version. Both have resulted in networks that play reasonable openings, but we had some issues with the value head not understanding good position
38.
by glinscott 9y ago
There is a public distributed effort happening for Go right now: http://zero.sjeng.org/ . They've been doing a fantastic job, and just recently fixed a big training bug that has resulted in a large strength increase. I
39.
by glinscott 9y ago
There are a ton scattered around :). Here is the announcement of fishtest on the talkchess forum: http://talkchess.com/forum/viewtopic.php?t=47885&highlight=s... Initial discussion of the introduction of SPRT into
40.
by glinscott 9y ago
Congratulations to Stockfish! The community is amazing, and the patches keep on flowing. The sheer number of ideas is pretty incredible. If you are interested in contributing, head over to http://tests.stockfishchess.org/
41.
by glinscott 9y ago
MCTS has done very poorly on chess compared to alpha-beta. Chess has a high number of forcing moves in capture sequences, and it's been very difficult to evaluate positions that are not settled. Traditionally an algorithm called a qu
42.
by glinscott 10y ago
Very cool to see Stockfish up here :). One of the cool parts is that the testing framework is fully open as well, at http://tests.stockfishchess.org/tests . It's been pretty amazing to watch the progress of SF since i
43.
by glinscott 12y ago
I wouldn't say the GBA was too forgiving about mistakes. You had very limited resources, and sometimes needed some tricks to get things running acceptably. I do remember a few things like a divide by zero in a game that ended up jump
44.
by glinscott 12y ago
Nearly all the evaluation terms in Stockfish have been extensively tuned. Joona Kiiski used the SPSA[1] algorithm on a lot of them. Others have been hand-tuned using tens of thousands of games per attempt on fishtest [2]. Fishtest actual
45.
by glinscott 15y ago
As noted on the Garbochess JS page, I didn't estimate the strength of the JS version. It would be much weaker than Garbochess 2.20 on the same hardware. Having a node.js uci adapter would be fun to test this. It will be very difficult to