Chess will never be solved, here's why

Sort:
Avatar of DiogenesDue
playerafar wrote:
tygxc wrote:

@11111

"Why not the cube root"
For strongly solving: N white moves * N black replies = N² positions
For weakly solving: N white moves * 1 black reply = N positions = Sqrt (N²) positions

My comment about cube root was a joke.
But the square root idea looks like its a joke too.

I would not call it a joke...it's a "common" enough methodology, used in checkers, finding prime numbers, etc. The problem is that Tygxc has not even begun to show that it would be applicable to chess, and that if it is, it likely applies to all possible games, the Shannon number 10^120, not unique positions.

Avatar of MARattigan
DiogenesDue wrote:
playerafar wrote:
tygxc wrote:

@11111

"Why not the cube root"
For strongly solving: N white moves * N black replies = N² positions
For weakly solving: N white moves * 1 black reply = N positions = Sqrt (N²) positions

My comment about cube root was a joke.
But the square root idea looks like its a joke too.

I would not call it a joke...it's a "common" enough methodology, used in checkers, finding prime numbers, etc. The problem is that Tygxc has not even begun to show that it would be applicable to chess, and that if it is, it likely applies to all possible games, the Shannon number 10^120, not unique positions.

The Shannon number is not and never was intended to represent the number of all possible games. Not even under competition rules (it's obviously infinite under basic rules).

Avatar of Optimissed
MARattigan wrote:

Exactly @Optimissed. You should try it. (Not trying to be clever, I mean - that's a given.)

You're about as creative as Dio.

Avatar of BigChessplayer665
Optimissed wrote:
MARattigan wrote:

Exactly @Optimissed. You should try it. (Not trying to be clever, I mean - that's a given.)

You're about as creative as Dio.

Who said we needed to be creative your mom?

Avatar of Optimissed

<<<The Shannon number is not and never was intended to represent the number of all possible games. Not even under competition rules (it's obviously infinite under basic rules).>>>

Not strictly. It's pointless to represent sequences of moves containing infinite meaningless repetitions of moves as "games". They're merely move sequences, so you're wrong. Since I was put in my place by your master, for making the completely reasonable observation that for practical purposes, the numbers of permutations of moves are infinite, and unfortunately for your side, the phrase "practical purposes" wasn't understood by your side, meaning that its general standard of linguistic expertise is so poor as to require that you should be going back to school to learn English, my correction here is far more to the point and correct.

More losses for your side, I fear.

Avatar of Optimissed
BigChessplayer665 wrote:
Optimissed wrote:
MARattigan wrote:

Exactly @Optimissed. You should try it. (Not trying to be clever, I mean - that's a given.)

You're about as creative as Dio.

Who said we needed to be creative your mom?

Stand in the corner. The general standard of entertainment from your side is abysmal.

Avatar of BigChessplayer665
Optimissed wrote:
BigChessplayer665 wrote:
Optimissed wrote:
MARattigan wrote:

Exactly @Optimissed. You should try it. (Not trying to be clever, I mean - that's a given.)

You're about as creative as Dio.

Who said we needed to be creative your mom?

Stand in the corner.

Arnt you in the corner ? Pouting like a 13 year old...

Avatar of MARattigan

I don't actually have a side @Optimissed, I just post. The sides are in your mind.

Avatar of DiogenesDue
MARattigan wrote:
DiogenesDue wrote:
playerafar wrote:
tygxc wrote:

@11111

"Why not the cube root"
For strongly solving: N white moves * N black replies = N² positions
For weakly solving: N white moves * 1 black reply = N positions = Sqrt (N²) positions

My comment about cube root was a joke.
But the square root idea looks like its a joke too.

I would not call it a joke...it's a "common" enough methodology, used in checkers, finding prime numbers, etc. The problem is that Tygxc has not even begun to show that it would be applicable to chess, and that if it is, it likely applies to all possible games, the Shannon number 10^120, not unique positions.

The Shannon number is not and never was intended to represent the number of all possible games. Not even under competition rules (it's obviously infinite under basic rules).

Whether 10^120 is the exact number is not really important...what's important is the distinction between 10^44 unique positions and the (much) larger set of possible games, and whether Tygxc is properly applying his reductions or not. Not to say he isn't, but his cut and paste explanation that we've all seen several dozen times is not doing the job.

Avatar of Elroch
MARattigan wrote:
Elroch wrote:

As my previous post explained, this implicitly assumes the tree of games is the same as the tree of positions. Because there are reversible moves in chess, the number of positions is way smaller than the number of games. 5 x 10^44 versus ~10^120

This means that positions dodged by only looking at one white move often reappear later.

But with far less frequency in FIDE competition rules chess and ICCF chess if you count a position as reappearing only if the possible forward play is the same in both cases.

And where on Earth does 10^120 come from?

10^120 is a rough estimate of the game tree complexity. The wiki article gives 10^123.
When the game tree is a tree without considering the history of a move and when the leaf positions are unique, the game tree complexity is similar to the state space complexity (number of positions).

Avatar of DiogenesDue
Optimissed wrote:

When you're trying to be clever it's better to get things right.

Feel free to get something right.

Avatar of Elroch
Optimissed wrote:
mrhjornevik wrote:

@optumissed

You keep skipping the question: what is your argument against Cantor?

@tygxc you keep skiping this question: Because a supercomputer calculating x number of moves fail to find a win, how does that assue that a maskine calculating x +1 moves would fail to find a win?

I didn't think I'd been asked again after the first time I gave my reason. Essentially, Cantor is positing the existence of finite numbers with special properties, in that they are finite but also infinite.

No. The DEFINITION of the adjective INFINITE is "NOT FINITE". This logically precludes any number from being both finite and infinite.

You need to first get enough understanding to avoid making obviously nonsensical statements.

Avatar of Optimissed
Elroch wrote:
Optimissed wrote:
mrhjornevik wrote:

@optumissed

You keep skipping the question: what is your argument against Cantor?

@tygxc you keep skiping this question: Because a supercomputer calculating x number of moves fail to find a win, how does that assue that a maskine calculating x +1 moves would fail to find a win?

I didn't think I'd been asked again after the first time I gave my reason. Essentially, Cantor is positing the existence of finite numbers with special properties, in that they are finite but also infinite.

No. The DEFINITION of the adjective INFINITE is "NOT FINITE".

Logic prevents any entity from having both property P and the property NOT P. Hint: to use this, set P to the property "finite".

All you are really saying is that English is too hard a language for you and you don't understand the subject you disagreed with me about.

Avatar of mrhjornevik
Optimissed wrote:
mrhjornevik wrote:

@optumissed

You keep skipping the question: what is your argument against Cantor?

@tygxc you keep skiping this question: Because a supercomputer calculating x number of moves fail to find a win, how does that assue that a maskine calculating x +1 moves would fail to find a win?

I didn't think I'd been asked again after the first time I gave my reason. Essentially, Cantor is positing the existence of finite numbers with special properties, in that they are finite but also infinite. His mistake is that they are unknown finite numbers, since the series of infinite numbers is endless. It has a beginning but no end. If we choose to include negative numbers in the infinite series, again there is ambiguity, since we can choose to begin the series at zero.

Hence there are finite numbers within the infinite series which are unknown. He has chosen to call them "transfinite numbers" since they would be defined as any finite number outside the series of known finite numbers. Known finite numbers are considered to be normal (in that they have been used in calculations or whatever .... not a very good reason) and unknown ones are ambiguous and hence trans-finite. It's rather similar to Schroedinger's cat. Schroedinger originally invented the idea of a cat which is not known to be either alive or dead as a joke, intended to discredit speculation regarding superpositioning or ambiguously live states and dead states in the kind of primitive or childish interpretations of quantum theory which had started to become current. However, such interpretations have tended to gain currency, not because they have any merit, except that they appeal to some kinds of speculative creativity.

Cantor was merely using his imagination and attempting to demonstrate numerical hypothetical series. He was considered by many to be insane and ideed he did become certifiably insane. Also his ideas have absolutely no real use or no use in reality.

I'm very used to Elroch and others like him, trying to impose their will on the thoughts of various people here. I have no doubt that he will tell me that I'm wrong and that I don't understand a, b, c, and/or d. That kind of speculative dismissal is meaningless. Elroch habitually supports whatever he wishes to support and is usually unable to give coherent arguments. His qualification is in statistics and this is pure mathematics. You can make a set of anything, including of bananas, but someone who understands set theory is not an expert on bananas because of that.

I think you missunderstand a few key details. I dont know what you mean with finite but infinite numbers. As for negative numbers its just a question of how we order them.

1= 1/1,

2 = 1/2 × -1,

3 = 1/2,

4 = 1/2 × -1,

5 = 2/1,

6 = 2/1 × -1

Do we agree that list contain all rational numbers, and that the list is infinitly large?

Now do we agree that at one point you come to number x = 3,14, and then later y = 3,15

Now you alternate between adding to this list, and a second list that contain all the real numbers. All the numbers of the first list will be on the second list so that x = 3,14 still on both lists. But when we come to y =3,15 on the first list the number pi will be on the second list so that on the second list y + 1 = 3,15

In this example there is no finite but infinite numbers. The list includes negative numbers. Both list are infinite, but one list is larger.

If all this is true then not all infinites are the same size.

Avatar of Optimissed

<<<No. The DEFINITION of the adjective INFINITE is "NOT FINITE">>>

Thinking that giving a definition of infinite makes your case is nothing more than an admission of your lack of ability.

It's called "misrepresentation". Basically you disagree with me so often that it is essentially bound to be you who is at fault. You never give proper arguments. It's all implications and you insinuate that your implications are correct and so maybe a few lesser-brained people round here will agree with you because they don't know what our relative abilities are and they just make assumptions.

You would have to have the calibre of Dio or playerafar to think you just made an argument. It is not even an argument; never mind a good one.

Avatar of Elroch
DiogenesDue wrote:
MARattigan wrote:
DiogenesDue wrote:
playerafar wrote:
tygxc wrote:

@11111

"Why not the cube root"
For strongly solving: N white moves * N black replies = N² positions
For weakly solving: N white moves * 1 black reply = N positions = Sqrt (N²) positions

My comment about cube root was a joke.
But the square root idea looks like its a joke too.

I would not call it a joke...it's a "common" enough methodology, used in checkers, finding prime numbers, etc. The problem is that Tygxc has not even begun to show that it would be applicable to chess, and that if it is, it likely applies to all possible games, the Shannon number 10^120, not unique positions.

The Shannon number is not and never was intended to represent the number of all possible games. Not even under competition rules (it's obviously infinite under basic rules).

Whether 10^120 is the exact number is not really important...what's important is the distinction between 10^44 unique positions and the (much) larger set of possible games, and whether Tygxc is properly applying his reductions or not. Not to say he isn't, but his cut and paste explanation that we've all seen several dozen times is not doing the job.

The 10^120 number is certainly a massive underestimate of the number of legal games using any reasonable ruleset. It relies on some sort of assumption about games being of a typical length.

To see this, note that even if we include a 50 move rule, the longest legal game is precisely 8848.5 moves). The number of legal games of exactly this length is certainly more than 2^8848.5 (surely more than 10^8848.5, but no need to overemphasise the point)

Avatar of MARattigan
Elroch wrote:
MARattigan wrote:
Elroch wrote:

As my previous post explained, this implicitly assumes the tree of games is the same as the tree of positions. Because there are reversible moves in chess, the number of positions is way smaller than the number of games. 5 x 10^44 versus ~10^120

This means that positions dodged by only looking at one white move often reappear later.

But with far less frequency in FIDE competition rules chess and ICCF chess if you count a position as reappearing only if the possible forward play is the same in both cases.

And where on Earth does 10^120 come from?

10^120 is a rough estimate of the game tree complexity. The wiki article gives 10^123.
When the game tree is a tree without considering the history of a move and when the leaf positions are unique, the game tree complexity is similar to the state space complexity (number of positions).

If you were referring to the game tree complexity why did you call it the number of games?

I don't have access to the link you provide. Can you sketch an argument for why the game tree complexity would be 10^123 (presumably for basic rules chess since you quote 10^44 as the number of positions and that can only be understandable, if some way adrift, for basic rules chess). It could certainly be relevant to the thread.

Avatar of Elroch
Optimissed wrote:

<<<No. The DEFINITION of the adjective INFINITE is "NOT FINITE">>>

Thinking that giving a definition of infinite makes your case is nothing more than an admission of your lack of ability.

Not understanding that the properties P and NOT P are mutually exclusive is a very extreme level of incompetence. It is literally like someone not knowing that 2+2=4 arguing about arithmetic.

Of course, the Dunning-Kruger effect then becomes relevant.

Avatar of Elroch
MARattigan wrote:
Elroch wrote:
MARattigan wrote:
Elroch wrote:

As my previous post explained, this implicitly assumes the tree of games is the same as the tree of positions. Because there are reversible moves in chess, the number of positions is way smaller than the number of games. 5 x 10^44 versus ~10^120

This means that positions dodged by only looking at one white move often reappear later.

But with far less frequency in FIDE competition rules chess and ICCF chess if you count a position as reappearing only if the possible forward play is the same in both cases.

And where on Earth does 10^120 come from?

10^120 is a rough estimate of the game tree complexity. The wiki article gives 10^123.
When the game tree is a tree without considering the history of a move and when the leaf positions are unique, the game tree complexity is similar to the state space complexity (number of positions).

If you were referring to the game tree complexity why did you call it the number of games?

You are entirely right that the two numbers are distinct in chess and I was wrong to conflate them. Thanks for drawing attention to this.

In games where there are no irreversible moves and no transpositions, the number of legal games is the number of leaf nodes. For example hex. These are the games where the idea that weak solution has the square root of the size of a strong solution makes best sense. But even here the game tree complexity is not the same as the number of leaf nodes, as I understand the definition.

I don't have access to the link you provide.

I linked it incorrectly, it seems. Here it is.

And the number for chess is later in the article, here.

Can you sketch an argument for why the game tree complexity would be 10^123 (presumably for basic rules chess since you quote 10^44 as the number of positions and that can only be understandable, if some way adrift, for basic rules chess). It could certainly be relevant to the thread.

I merely quoted the value from the article, having seen others previously. To me it cannot make sense for basic rules chess, since a tablebase has complexity ~10^44 and that strong solves the game. 

Avatar of mrhjornevik
mrhjornevik wrote:
Optimissed wrote:
mrhjornevik wrote:

@optumissed

You keep skipping the question: what is your argument against Cantor?

@tygxc you keep skiping this question: Because a supercomputer calculating x number of moves fail to find a win, how does that assue that a maskine calculating x +1 moves would fail to find a win?

I didn't think I'd been asked again.

I think you missunderstand a few key details. I dont know what you mean with finite but infinite numbers. As for negative numbers its just a question of how we order them.

1= 1/1,

2 = 1/2 × -1,

3 = 1/2,

4 = 1/2 × -1,

5 = 2/1,

6 = 2/1 × -1

Do we agree that list contain all rational numbers, and that the list is infinitly large?

Now do we agree that at one point you come to number x = 3,14, and then later y = 3,15

Now you alternate between adding to this list, and a second list that contain all the real numbers. All the numbers of the first list will be on the second list so that x = 3,14 still on both lists. But when we come to y =3,15 on the first list the number pi will be on the second list so that on the second list y + 1 = 3,15

In this example there is no finite but infinite numbers. The list includes negative numbers. Both list are infinite, but one list is larger.

If all this is true then not all infinites are the same size.

Can hou now explain your position? @opti

This forum topic has been locked