Search found 900 matches

by AlvaroBegue
Wed Jul 24, 2019 11:32 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Random mover win rate
Replies: 9
Views: 1518

Re: Random mover win rate

After searching the web for about 3 minutes: http://wismuth.com/chess/random-games.html

Enjoy!
Álvaro.
by AlvaroBegue
Sun Jun 09, 2019 8:14 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: max number of pseudo legal move
Replies: 29
Views: 4806

Re: max number of pseudo legal move

This is not even hard. I have no experience constructing proof games, and I succeeded after a few minutes: [Event "Edited game"] [Site ""] [Date "2019.06.09"] [Round "-"] [White "-"] [Black "-"] [Result "*"] 1. a4 b5 2. axb5 a6 3. bxa6 Bb7 4. axb7 g5 5. bxa8=Q g4 6. h4 Bh6 7. g3 Bg5 8. hxg5 f5 9. Rh...
by AlvaroBegue
Fri May 10, 2019 2:44 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: catastrophic forgetting
Replies: 5
Views: 1432

Re: catastrophic forgetting

Is training for all the variants at the same time an option? I mean, have each minibatch contain examples from each of the variants.
by AlvaroBegue
Fri Apr 26, 2019 12:00 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Endgame evaluation
Replies: 5
Views: 838

Re: Endgame evaluation

There are conditions when you can simply return a value without further search. Some ICCA paper by the authors of DarkThought in the 90s called this "interior-node recognizers": https://www.chessprogramming.org/Interior_Node_Recognizer For situations where you are not sure (say KQKB), you can still ...
by AlvaroBegue
Wed Mar 13, 2019 1:04 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: I lost my rant :(
Replies: 4
Views: 1314

Re: I lost my rant :(

Part of the problem is your coding style. Your function names are OK, but your variable names are not informative at all. I have no idea what `ts', `ns', `nd', `mt', or `m' mean. Chances are you won't know when you encounter the code in a couple of days either. You should write code that is easy for...
by AlvaroBegue
Tue Feb 19, 2019 11:57 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: categorical cross entropy for value
Replies: 7
Views: 1234

Re: categorical cross entropy for value

I understand your concern, but I suspect in practice it won't matter. Looking at enough examples, the network can figure out that strong positions for white end up being either won by white or draws the vast majority of the time, even if it doesn't know that loss < draw < win.
by AlvaroBegue
Mon Feb 18, 2019 5:51 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: categorical cross entropy for value
Replies: 7
Views: 1234

Re: categorical cross entropy for value

You don't propose an alternative, so it's hard to discuss pros and cons. However, these matters always come down to an empirical question. Having a scheme that produces distinct probabilities for the outcomes has the advantage that they can be combined however necessary when we use the network. For ...
by AlvaroBegue
Thu Feb 14, 2019 10:55 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: A0 subtlety
Replies: 29
Views: 4508

Re: A0 subtlety

Was a set of input planes representing a position at time (t - T + 1) oriented for the side to move at time t or time (t - T + 1)? All the history input planes are oriented for the current side to move, i.e. at time t. Would it matter if they weren’t? (That’s a serious question btw) I suppose not b...