Search found 206 matches

by Tony P.
Thu Jul 16, 2020 5:08 pm
Forum: Computer Chess Club: General Topics
Topic: Lizard-NNUE Experiment NOT bad with NNUE Net Evaluation.........
Replies: 53
Views: 6695

Re: Lizard-NNUE Experiment NOT bad with NNUE Net Evaluation.........

Oops, I meant chess.com's Computer Chess Championship (C3 is a better abbreviation for it, right?). There are no grounds for a ban from Computer Chess Club, of course.
by Tony P.
Thu Jul 16, 2020 4:50 pm
Forum: Computer Chess Club: General Topics
Topic: Lizard-NNUE Experiment NOT bad with NNUE Net Evaluation.........
Replies: 53
Views: 6695

Re: Lizard-NNUE Experiment NOT bad with NNUE Net Evaluation.........

No matter the legal status of a net distilled from Komodo's output without Mark's permission, what he can do is have it banned from C3. If the trainers are fine with the loss of this avenue for promotion, they can go ahead with the distillation :P
by Tony P.
Thu Jul 16, 2020 4:16 pm
Forum: Computer Chess Club: General Topics
Topic: Lizard-NNUE Experiment NOT bad with NNUE Net Evaluation.........
Replies: 53
Views: 6695

Re: Lizard-NNUE Experiment NOT bad with NNUE Net Evaluation.........

Well, maybe it's a good idea to investigate what we are talking about, without the punitive, as Mark said NN's are a whole different world. A quick test with some adviced nets. Using a random epd of 10,000 positions at depth=1. Thanks for the revealing analysis :D What's the correlation between All...
by Tony P.
Thu Jul 16, 2020 8:20 am
Forum: Computer Chess Club: General Topics
Topic: Lizard-NNUE Experiment NOT bad with NNUE Net Evaluation.........
Replies: 53
Views: 6695

Re: Lizard-NNUE Experiment NOT bad with NNUE Net Evaluation.........

^^ Generally, one can ask the author(s) of a program if they mind its cloning. There are strong indications that Jon wouldn't mind (though you'd still better ask): 1. His very choice of the MIT license. 2. The post where he explained his attitude to the reuse of his software. 3. The existence of Ara...
by Tony P.
Thu Jul 16, 2020 6:09 am
Forum: Computer Chess Club: General Topics
Topic: Lizard-NNUE Experiment NOT bad with NNUE Net Evaluation.........
Replies: 53
Views: 6695

Re: Lizard-NNUE Experiment NOT bad with NNUE Net Evaluation.........

dkappe wrote:
Thu Jul 16, 2020 12:10 am
It seems almost like a theft of Komodo’s intellectual property.
Fwiw, behavioral cloning (that's a scientific term!), as well as any other kind of knowledge distillation, from Arasan would be perfectly legal :wink: And ironically, it might still yield a stronger engine than SF.
by Tony P.
Thu Jul 16, 2020 4:42 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: NADYA2.0 engine progress
Replies: 19
Views: 11251

Re: NADYA2.0 engine progress

Wow, I'd never consider writing a whole chess engine in a logic programming language :o There are, however, important chess tasks that this approach would excel at, such as the verification of either side's ability to secure at least a draw, which would increase the accuracy of evals in training set...
by Tony P.
Mon Jul 13, 2020 10:21 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Data structure choice for TT
Replies: 35
Views: 13293

Re: Data structure choice for TT

If I am not mistaken the LRU is an equivalent method as I proposed but uses a little bit more space than mine Since I do not need an age field. LRU doesn't require an age field - it's indeed enough to put entries into a queue like you've proposed. That way, you save space at the cost of the time to...
by Tony P.
Mon Jul 13, 2020 9:19 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Data structure choice for TT
Replies: 35
Views: 13293

Re: Data structure choice for TT

hgm wrote:
Mon Jul 13, 2020 9:08 pm
So accesses occur in bursts. This can easily make a shallow entry temporarily pass a deep entry in your scheme, leading to overwriting of the deep entry.
Ah, so that's why Leela is using the LRU cache replacement policy instead of the LFU one. Thanks for enlightening me again! :idea:
by Tony P.
Mon Jul 13, 2020 3:52 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Data structure choice for TT
Replies: 35
Views: 13293

Re: Data structure choice for TT

Tony P. wrote:
Mon Jul 13, 2020 3:05 pm
What are some examples of fast and strong engines with non-Zobrist hashes?
Oops, Leela is an obvious example :oops: (of a strong one). Its hash function, based on a few additions, multiplications, bit shifts and concatenations, doesn't seem slow.
by Tony P.
Mon Jul 13, 2020 3:38 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Mind your language
Replies: 16
Views: 4121

Re: Mind your language

The Youtube video used various sources of data, outlined in its description. It didn't use TIOBE alone, fortunately.