7-piece tablebase win in 517 moves

[GothicChessInventor]

I think I know. If you look at the Nalimov indexing code, there are no mathematical functions for what to do when one side has 5 of the same piece type.

So, like QQQQQ vs. X cannot be indexed by the current version of the database.

It's easy to write such an indexing function, I've done them for checkers, chess, and Gothic Chess.

[ernest]

If you look at the Nalimov indexing code, there are no mathematical functions for what to do when one side has 5 of the same piece type.
So, like QQQQQ vs. X cannot be indexed by the current version of the database.

Aha, thanks, Ed!