Search found 903 matches

by AlvaroBegue
Thu Dec 05, 2019 4:02 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Pawn move generation in bitboards
Replies: 3
Views: 299

Re: Pawn move generation in bitboards

Just a note on C++ style. Using a few features from modern C++, you can make the code look quite clean. For instance, you can write wrappers around basic integer types to represent squares and bitboards, so you can print then naturally with `std::cout <<'. You can also make use of range-based for lo...
by AlvaroBegue
Fri Nov 22, 2019 6:52 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: N-Queens in 110 languages
Replies: 7
Views: 561

Re: N-Queens in 110 languages

Here's a very short one in C++, without much obfuscation: #include <iostream> #include <algorithm> #include <vector> const int n = 8; bool check_permutation(std::vector<int> const &v) { for (int i = 0; i < n; ++i) { for (int j = i + 1; j < n; ++j) { if (std::abs(v[i]-v[j]) == std::abs(i-j)) return f...
by AlvaroBegue
Thu Oct 31, 2019 6:03 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Ubuntu Shell file
Replies: 8
Views: 1107

Re: Ubuntu Shell file

To answer the original question, you are probably using bash as your shell. Instead of writing a script, you can define a bash function (https://linuxize.com/post/bash-functions/), which doesn't spawn a new process, and would be able to change the working directory just fine.
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: 1715

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: 5427

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: 1601

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: 965

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: 1440

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...