Search found 87 matches

by Tony P.
Thu Jan 16, 2020 9:35 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Board adaptive / tuning evaluation function - no NN/AI
Replies: 12
Views: 479

Re: Board adaptive / tuning evaluation function - no NN/AI

I might end up trying some method from this survey of knowledge graph embeddings/projections (treating positions as KGs) or whichever survey will be the most up-to-date then, but I expect a lot of trial and error :( as the trade-off between eval accuracy and speed seems dramatic in chess.
by Tony P.
Thu Jan 16, 2020 8:07 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Board adaptive / tuning evaluation function - no NN/AI
Replies: 12
Views: 479

Re: Board adaptive / tuning evaluation function - no NN/AI

They represent the entire game, not just the current state. Mu0 was tested vs A0 with a search budget of 800 (lol) nodes per decision. I doubt Mu0 would be competent at large search depths without modifications, as it only encodes the root and then searches in the latent space. However, if it were ...
by Tony P.
Wed Jan 15, 2020 5:40 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Board adaptive / tuning evaluation function - no NN/AI
Replies: 12
Views: 479

Re: Board adaptive / tuning evaluation function - no NN/AI

OK, there's no need to read that dissertation - there's so much literature available that I can't be sure which method is optimal, need to use RL techniques to learn to explore the space of RL papers more efficiently :lol: Here's a possibly more interesting paper: Measuring Structural Similarities i...
by Tony P.
Wed Jan 15, 2020 4:28 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Board adaptive / tuning evaluation function - no NN/AI
Replies: 12
Views: 479

Re: Board adaptive / tuning evaluation function - no NN/AI

Has anyone used a NN for hashing or board state representation/encoding ? It has been done in MuZero *. I like the approach a lot and think Mu0 would grow a lot stronger than Alpha0 if Deepmind hadn't switched it from chess to tasks that interested the team more. Another piece on this topic (albeit...
by Tony P.
Wed Jan 15, 2020 8:29 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Board adaptive / tuning evaluation function - no NN/AI
Replies: 12
Views: 479

Re: Board adaptive / tuning evaluation function - no NN/AI

I'm not sure what you mean by 'AI'. Nowadays, it's standard for strong engines to use at least a bit of machine learning, e.g. Texel tuning . Out of the current engines, Winter is the one that I find the soundest scientifically. It has started using a small NN for eval recently but used to rely on l...
by Tony P.
Tue Jan 14, 2020 8:30 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Leela avoids taking a pawn early on
Replies: 2
Views: 757

Re: Leela avoids taking a pawn early on

6. Nf3! starts a strong attack that exploits Black's development lag and seems to win at least a piece in all the variations. They're indeed hard for a human to calculate, but modern engines find the move instantly (I've used a 1-year-old SF version on a slow laptop). 1. d4 d5 2. c4 c6 3. Nc3 Bf5?! ...
by Tony P.
Fri Sep 22, 2017 3:32 pm
Forum: Computer Chess Club: General Topics
Topic: Another possible toy for AI programmers: 4-player chess
Replies: 9
Views: 1198

Re: Another possible toy for AI programmers: 4-player chess

This version has substantial bonuses for piece captures, so 'leaning back' is still less lucrative than attacking - in the process of 'exhausting each other', armies will earn points for captures and double / triple checks that might turn out vital in the final tally. For future reference, here are ...
by Tony P.
Fri Sep 22, 2017 3:38 am
Forum: Computer Chess Club: General Topics
Topic: Another possible toy for AI programmers: 4-player chess
Replies: 9
Views: 1198

Re: Another possible toy for AI programmers: 4-player chess

Don't know which one did better but it can play reasonably with both given the inherent issue with collusion. The only really dangerous form of collusion is a pre-agreed coalition of 3 players against 1, which chess.com will likely prohibit explicitly and also try to prevent by rule changes and pse...
by Tony P.
Thu Sep 21, 2017 4:29 pm
Forum: Computer Chess Club: Tournaments and Matches
Topic: Super Tournament XXVII 8CPU
Replies: 62
Views: 20326

Re: Games 1-8

Oh, thanks for letting me know that double spaces are the issue!

Then I'll be quoting posts, copypasting their entire content into a text editor and locating the pgn tags via the search function. Fortunately, this is easy enough.
by Tony P.
Thu Sep 21, 2017 3:52 pm
Forum: Computer Chess Club: Tournaments and Matches
Topic: Super Tournament XXVII 8CPU
Replies: 62
Views: 20326

Re: Games 1-8

I still slightly prefer clicking on d8 to quoting the post because it's a bit hard to select the text exactly between the [pgn ] and [/pgn ] tags in the long raw code of a quoted post.