#3883
"I'd much rather ask a Digital Intelligence expert." ++ No not at all. Top grandmasters, their seconds, and ICCF grandmasters know most about chess and chess analysis.
"a weak solution is an overall verdict on what has been called the game- theoretical value."
++ No. You still do not get it.
Ultra-weakly solved means that the game-theoretic value of the initial position has been determined. In layman's terms: it means a formal proof that chess is a draw.
Weakly solved means that for the initial position a strategy has been determined to achieve the game-theoretic value against any opposition. In layman's terms: it means that a way to draw for black has been found against all reasonable white moves. That would need to visit 10^17 positions, can be done in 5 years.
"strongly solved is being used for a game for which such a strategy has been determined for all legal positions." In layman's terms: a 32-piece table base. That is all 10^44 legal positions, beyond the capability of present engines.
"That can't be obtained without a full solution of all possible and relevant games, each explored to the point where it's obvious what the result will be." ++ A solution tree of 10^17 positions would lead to a proof tree of about a billion positions, i.e. about 10 million perfect games.
"It would probably be impossible to store all these results" ++ No, 10 million perfect games are not that much more than existing data bases holding millions of games.
"btickler's calculations will be the more accurate" ++ No, he has no clue. He still does not understand the difference between weakly solving and strongly solving.
I apparently understand the definitions better than you do. Weakly solving means solving against all moves from the initial position, not just "reasonable" moves. Trying to change the definition of weakly solved to fudge your numbers doesn't help your case, it just makes you look desperate enough to mislead people wilfully...
Ultra-weak
Prove whether the first player will win, lose or draw from the initial position, given perfect play on both sides. This can be a non-constructive proof (possibly involving a strategy-stealing argument) that need not actually determine any moves of the perfect play.
Weak
Provide an algorithm that secures a win for one player, or a draw for either, against any possible moves by the opponent, from the beginning of the game.
Strong
Provide an algorithm that can produce perfect moves from any position, even if mistakes have already been made on one or both sides.
I completely agree with btickler that tygxc has drastically underestimated the number of lines and therefore positions that have to be examined for a so-called weak solution. This is because the algorithms have to widen the search considerably, in order to eliminate apparently relevant lines that turn out to contain a mistake.
The strong algorithm is irrelevant and indeed, so is the concept. This is because the so-called algorithm to produce a weak solution actually means "produce a perfect chess engine which makes no mistakes and which always plays the best moves". There's a logical absolute identicality. Therefore it's all that's required.
The definition for the ultra weak solution is problematic, since any such strategic argument would have to be proven to be completely reliable and accurate. It is, however, identical in approach to the suggestion I made three or four years ago in another thread, regarding trying to create an algorithm that identifies points of imbalance and recrystallisation in chess games.
#3886
"I apparently understand the definitions better than you do."
++ Your toilet paper calculation shows otherwise.
"Weakly solving means solving against all moves from the initial position"
++ Cutting out unreasonable moves based on knowledge is allowed per van den Herik.
I know 1 e4 e5 2 Ba6 loses for white, so I do not need to calculate to checkmate.
I know 1 a4 cannot be better than 1 e4 or 1 d4, so I do not need to calculate 1 a4 to a draw.
"Trying to change the definition"
++ I do not change the definition. I replicate the definition verbatim.
I just explain in layman's terms as some people complain they do not understand jargon.
"Weak Provide an algorithm that secures a win for one player, or a draw for either,
against any possible moves by the opponent, from the beginning of the game."
++ It is not an algorithm, but a strategy.
Such a strategy can entail a proof tree, but also a set of rules, or a combination.
Allen has weakly solved Connect Four by brute force
and Allis has independently weakly solved it by a set of 7 rules.
"Strong Provide an algorithm that can produce perfect moves from any position,
even if mistakes have already been made on one or both sides."
++ Not an algorithm, but a strategy for all legal positions.
Not only after one or more mistakes have been made, but also alternative drawing paths after one drawing strategy has been found. If 1 e4 e5 is proven a draw, then for weakly solving it does not matter if 1 e4 c5 draws as well or not, but for strongly solving that is needed too.
The essence is that weakly solving needs to visit far less positions than strongly solving.
Weakly solving Losing Chess required 900 million positions, not 10^44.