Search found 418 matches

by Rémi Coulom
Thu Oct 31, 2019 10:33 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: UCI Win/Draw/Loss reporting
Replies: 63
Views: 4016

Re: UCI Win/Draw/Loss reporting

Especially because engines like LC0 score only in terms of probability - without WDL support, there is no meaningful eval display possible. Printing the score in centipawns and expecting the user to know this is meant as win score expectation is a bad hack anyway. The other way around fails also be...
by Rémi Coulom
Mon Oct 07, 2019 12:15 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: A book on machine learning
Replies: 7
Views: 1822

Re: A book on machine learning

I took a quick look at the content, and it seems there is extremely little machine learning in this book, except for a decision tree in Chapter 2. Mostly genetic algorithms and population-based methods. No neural network. But what they describe may be fun programming experiments.
by Rémi Coulom
Thu Oct 03, 2019 12:43 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: trying to understand mcts
Replies: 13
Views: 3483

Re: trying to understand mcts

Zeta v097 and v098 were an attempt to make use of thousands of parallel gpu- threads via an parallel Best-First-MiniMax search and classic evaluation. Very interesting, thanks. When using large neural networks, evaluation is so slow that data transfers between CPU and GPU have very little cost. To ...
by Rémi Coulom
Thu Oct 03, 2019 9:56 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: trying to understand mcts
Replies: 13
Views: 3483

Re: trying to understand mcts

I tried to reuse the current tree for the next move, but in Zeta v097/v098 I had to copy the tree back n forth between cpu/gpu, and the memory got quickly filled, so I kept it as disabled option. But in theory it should give you an boost. You store the tree in the GPU? I am very surprised. My intui...
by Rémi Coulom
Tue Sep 10, 2019 7:24 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Search-based opening book
Replies: 17
Views: 5790

Re: Search-based opening book

Hi, I have also been generating an opening book automatically. My approach is simply to use MCTS to grow the book, using a long search to evaluate the leaves, and negamax backup. It is a bit similar to the drop-out expansion approach of the Othello book algorithms, but I like the MCTS approach bette...
by Rémi Coulom
Sat May 04, 2019 6:33 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: On-line engine blitz tourney April
Replies: 17
Views: 3286

Re: On-line engine blitz tourney April

Othello(Reversi)? Nice, how does it do against the big guys, e.g NTest, Edax etc? Also are you gonna release any of them? And will the whole framework be open sourced? I would be interested in a Capablanca Random Chess NN network so I keep dreaming. :D I did Othello very rapidly. It is probably not...
by Rémi Coulom
Sun Apr 28, 2019 2:19 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: SL vs RL
Replies: 8
Views: 2343

Re: SL vs RL

RL has the same problem. Weak moves of early self-play games are rapidly forgotten. In Go, the alphazero method has a very severe problem with ladders. It is similar to what you describe. A fundamental flaw of the Alpha Zero approach is that it learns only from games between strong players. When the...
by Rémi Coulom
Sun Apr 28, 2019 1:17 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Training using 1 playout instead of 800
Replies: 12
Views: 2349

Re: Training using 1 playout instead of 800

Btw AG original implmentation of policy gradient did not have random sampling or dirichlet noise so there is a tendency to converge to local optima. I think they used different opponents from the pool of players at the time and only maybe discovered random sapling and noise later. The mathematical ...