TalkChess.com

You can also run a consistency check. You can visit every position and check that the value it got assigned in the tablebase is consistent with the value of its children.

This is much easier to do in C++, because you can just use a custom data type instead of `float' and the gradient will be computed for you automatically. For instance, see the example here: https://github.com/autodiff/autodiff It's not hard to write your own reverse-mode automatic differentiation li...

Yes, day 13 part 2 is about the Chinese Remainder Theorem. It was nice to brush up on things I haven't done in over 20 years: Extended Euclid's algorithm, Bézout's identity...

That won't work. The engine doesn't stop reading input while it's thinking. So it will process the end of file and terminate the search. You need to feed it the commands at the right time. I don't know how you do that in BASIC, but I've done it in Perl before and it worked just fine. From bash this ...

You should take your own advice then, RuyDos is full of single-character variables/function arguments and even function names. I have no problem with short names as I understand that o is occupancy, N stands for north etc., but if you assume a certain position and do the exact opposite yourself, we...

I also have attention problems, which makes it impossible for me to read code with short identifiers. Mathematicians are generally terrible with this, using single-letter variable names for everything. Once there are more than six of these being used, I have to go back and forth between the text and...

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

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

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.

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

Enjoy!
Álvaro.