GOH, can you explain exactly what table bases are? Never heard of them until this discussion.
For example, lets imagine one black and one white king on a board. How many unique ways can they be placed?
There are 64 places to put the first king, and for each of those 63 ways to place the 2nd king. So I assume 64x63=4032 unique positions.
Anyway, a tablebase has every single possible position stored and solved all the way to mate (if there is a mate) and if there's not, then it's a draw.
---
"So what?" You might ask. Well for trivial positions, you're right, it doesn't matter, but if you start from just 3 pieces and work your way up, and if you literally store every single possible position, then you can end up solving some ridiculous positions.
Like this position.
White to move has a forced mate in 549 moves. An engine would never solve this.
All positions with 6 pieces or less have been completely solved (kings are counted)
Some positions with 7 pieces have been solved (or I wonder if they've finished all by now?) But with 7 we're already reaching our limits because this over 100 terribyes IIRC, and from 7 to 8 will of course be an exponential increase.



GOH, can you explain exactly what table bases are? Never heard of them until this discussion.
Haha!