I'd like to play a bit with fairy tablebases (Vaclav Kotesovec published quite a few) and am far too lazy to program them anew, especially as I wouldn't wonder if there is free code floating around, and I just would have to find where the PARAMETER N=8 statement hides. (BTW, the results can be quite interesting: as I suspected anyway, Q vs R is drawn on a very large board, and with the right size even a mutual zugzwang exists.)
Still, I never was lucky googling. Do you have any resources? (GitHub, chess programming BBS, maybe even scientific papers)