@6746
"the question is to derive it from the start. Thats solving for all 8x8 chess"
++ No that is not solving 8x8 chess.
Determining if the starting position is a draw, a win, or a loss is ultra-weakly solving chess. There is massive evidence from millions of human and engine games as well as the logical argument that a tempo is not enough to win to know that the initial position is a draw.
Weakly solving chess is figuring out how to draw from the starting position. It is thus the path from the initial position to other drawn positions until a known draw, like a 7-men endgame table base draw or a prior 3-fold repetition.
Strongly solving chess is figuring out for all legal positions if they are draw, a win, or a loss.
"Solving chess means finding an optimal strategy for the game of chess, that is, one by which one of the players (White or Black) can always force a victory, or either can force a draw (see solved game)" - Wikipedia
The only way to do that is to go through the entire position tree because you don't know if black's position is a starting loss. Because game theory says both sides have perfect information, and like you said about tempo advantage, you literally don't know if the starting position is a win loss or draw of white. I am not sure what you are saying, because what I am talking about is literally "solving chess", and this is coming from someone who took a class on weak and strong deterministic problems.
I can see what you are saying about, "Strongly solving"chess, but if you think about its the same case, where you would need a quantum computer to just go through all the variations, and if you think about it, if you find the most optimal solution any other legal position would be a loss from which ever side changed from the given optimal solution and you wouldnt have to go through all those tree paths
@6746
"the question is to derive it from the start. Thats solving for all 8x8 chess"
++ No that is not solving 8x8 chess.
Determining if the starting position is a draw, a win, or a loss is ultra-weakly solving chess. There is massive evidence from millions of human and engine games as well as the logical argument that a tempo is not enough to win to know that the initial position is a draw.
Weakly solving chess is figuring out how to draw from the starting position. It is thus the path from the initial position to other drawn positions until a known draw, like a 7-men endgame table base draw or a prior 3-fold repetition.
Strongly solving chess is figuring out for all legal positions if they are draw, a win, or a loss.