I'm not even convinced by this suspicion of "practical unproven solution". We should look at tablebase positions and see what happens with engines.Uri Blass wrote: ↑Mon Sep 07, 2020 12:14 pmA possible reason to believe some chess position is special is if we see some program that practically does not lose with white or black.
We can suspect that some engine practically solved the position in the meaning that it is unbeatable even with no mathematical proof that the game is a draw.
e.g. this position ---
I can predict the engines will have many tablebase "blunders" here, but I don't know what the result of all the blundering will be. Can someone please run a few engine games and see? If engines draw all the time, we could suspect that it is a draw, but then we would be wrong.