@6717
"White will win if both sides play perfectly" ++ No, when both sides play perfectly it is a draw.
"unless you go through the entire decision tree of possible moves you could never know"
++ It is beneficial to incorporate game knowledge into game solving.
If the 4 best moves cannot win for white, then the 16 worst moves cannot win either.
"what you mean by 146 moves exhausts all the moves"
There are 10^44 legal positions. 10^44 = 2^146.
Thus a forced win of 546 moves must contain a string of forced moves by the defending side.
146 choices between 2 moves yields more positions than chess has legal positions.
"8x8 chess is in EXP time"
++ To strongly solve chess 10^44 legal positions need to be visisted.
That is beyond present capability. It might become possible with a quantum computer.
To weakly solve chess 10^17 relevant positions need to be visited.
That can be done with 3 powerful computers running for 5 years.
Many here still fail to understand the difference between strongly solving and weakly solving.
"your method of pruning the data"
++ It is not my method, it is the same method that Schaeffer used to weakly solve Checkers.
What are you talking about? It literally is Game Theory, both sides Black and White have perfect information therefore making impossible to know if its A Win, Loss or Drawn for any side. Its literally a theorem and its described in the quote I posted
well maybe your right Optimissed.. but for the Human mind.. for a chess engine i'm sure will eventually figure out chess just like it did with checkers....