optimissed the "weakly solved" that tygxc is claiming to cite is literally defined by there being such an algorithm.
There is no algorithm possible in chess for what is being claimed. Chess in reality is not a strategy game. So algorithms will fail in most cases. As chess is a 100% tactical game. And every chess position only has 3 true evaluations. White wins, Black wins, or the position is a draw with perfect play.
And they only way to know what one is correct is by pure calculation in most cases.
And that is the reason why chess will never be, and can never be solved.
The game tree is just far too vast.
again, thats not how algorithms are defined in terms of "solving" you know the 7 piece tablebase? that's techinically an algorithm.
TB are not an algorithm. TB are tables of already calculated moves and stored. There is no calculation being done.
Algorithm defined.
a process or set of rules to be followed in calculations or other problem-solving operations, especially by a computer.
yes. the rules are to follow the tablebase.
you have an input and output.
@7979
++ What is the relevance to (weakly) solving Chess?