On-demand tablebase generation

Discussion of chess software programming and technical issues.

Moderator: Ras

User avatar
Evert
Posts: 2929
Joined: Sat Jan 22, 2011 12:42 am
Location: NL

Re: On-demand tablebase generation

Post by Evert »

Melin wrote:Got a slight additional improvement using the bitboards for the bishop, instead of for the black king. This gives higher bit density, the number of calls to enter is reduced by about half.
I wonder: does that generalise to other endings, or is it specific for KBNK?
If it generalises well to other endings it might be worth doing there. If not, well, optimising for a special case is generally not such a good thing...
Melin
Posts: 2
Joined: Wed Feb 19, 2014 10:03 pm

Re: On-demand tablebase generation

Post by Melin »

Well, the idea to use the piece that gives the highest bit density (I suspect the piece with the highest mobility) should give a speedup. But I doubt if it would be worth the extra headache when writing generic code. Writing a generic generator is already to messy, rotations and all. Generalising with regards to this as well, would be to complex, at least for me. I might try KQKR, using bitboards for queen.