Is your new plan to fill the forum with irrelevant uncertainty and count that as a proof, @tygxc?
Hint: go learn what a proof is.
Chess will never be solved, here's why
Sort:
Jun 7, 2024
0
#8683
tygxc wrote:
@11560
"Almost is not a weak solution almost is still almost"
++ The 107 ICCF WC Finals draws form at least part of a weak solution of Chess.
Not yet complete, but redundant: more than 1 way to draw.
they form 1*10^-15 of it. what about the other 10^17.
@11566
"how about black blunders instead"
++ You cannot make an error in a lost position.
Jun 7, 2024
0
#8685
tygxc wrote:
@11564
"they had two different players"
++ The ICCF WC Finals has 17 different players.
It was a race with one horse with 17 fleas on its back.
Jun 7, 2024
0
#8686
Elroch wrote:
Is your new plan to fill the forum with irrelevant uncertainty and count that as a proof, @tygxc?
Hint: go learn what a proof is.
that's why i was trying to get tygxc to reveal his math education. when I was 10 i had a better understanding of proof than tygxc does.
tygxc wrote:
@11566
"how about black blunders instead"
++ You cannot make an error in a lost position.
Black blunders2??
White blunders and is losing 2??
Black blunders back and is losing 2??
White blunders and is losing 2 ??
Black spots the winning move with no errors 0??
Total of 8
@11571
Each game has like 80 positions. For each position they calculated 5 days, considering many alternative positions. A game lasts 2 years.
'I have two servers, each capable of calculating more than 90 million positions a second.'
https://new.uschess.org/edwards-32nd-ICCF-ch
2 servers/finalist * 17 finalists * 90*10^6 positions/s/server * 3600 s/h * 24 h/d * 365 d/a * 2 a = 1.9 * 10^17 positions
Jun 7, 2024
0
#8689
Proofs are not judged on how much electricity they used to make them. They are judged on rigor.
Hilariously, you say that you are able to play perfect chess as long as you are assisted by an engine that blunders all the time in tablebase positions and a human that has had a good run with his engine and would blunder more often in the same positions.
@11573
"17 fleas"
Insulting ICCF (grand)masters as fleas shows you know nothing about correspondence play.
You should really sign up for an ICCF WC qualifier and get beaten so you understand.
@11574
"when I was 10" ++ Last year?
Jun 7, 2024
0
#8692
tygxc wrote:
@11571
Each game has like 80 positions. For each position they calculated 5 days, considering many alternative positions. A game lasts 2 years.
'I have two servers, each capable of calculating more than 90 million positions a second.'
https://new.uschess.org/edwards-32nd-ICCF-ch
2 servers/finalist * 17 finalists * 90*10^6 positions/s/server * 3600 s/h * 24 h/d * 365 d/a * 2 a = 1.9 * 10^17 positions
its a node, not a full positional calculation
maybe if you actually READ the articles you cited you would have known that.
but ive only been pointing that out for months.
Jun 7, 2024
0
#8693
tygxc wrote:
@11574
"when I was 10" ++ Last year?
imagine being called out on your logical fallacies by an 11-year-old.
why arent you addressing the 4 basic facts that i keep reminding you that you have wrong? (there are of course, many others, but i notice that these four you dont even acknowledge)
tygxc wrote:
@11574
"when I was 10" ++ Last year?
Womp womp
MEGACHE3SE wrote:
tygxc wrote:
@11574
"when I was 10" ++ Last year?
imagine being called out on your logical fallacies by an 11-year-old.
why arent you addressing the 4 basic facts that i keep reminding you that you have wrong?
Even worse a 16 year old
Jun 7, 2024
0
#8696
tygxc wrote:
@11573
"17 fleas"
Insulting ICCF (grand)masters as fleas shows you know nothing about correspondence play.
You should really sign up for an ICCF WC qualifier and get beaten so you understand.
elroch you made the mistake of using an analogy with abstract reasoning with tygxc. tygxc cant follow that.
Jun 7, 2024
0
#8697
Optimissed wrote:
tygxc wrote:
@11534
"the sheer number of possible positions" ++ There are 10^44 legal chess positions,
of which 10^37 without promotions to pieces not previously captured.
Of these 10^17 are relevant to weakly solving chess, as Schaeffer did for Checkers.
"calculate every potential outcome" ++ It is not necessary to calculate everything:
weakly solving chess only needs 1 black reply to all reasonable white moves.
I think that if you would pause and think for yourself for a moment, you would realise that in order to find that one black reply to each move by white, it is necessary to investigate very thoroughly quite a large number of black replies to every white move. I mentioned five candidate moves earlier (a couple of weeks since) but I also mentioned that to do the job properly, maybe nine candidate moves would suffice. That would be your "weak solution".
Here the quotation marks are appropriate, since the term is being used incorrectly by @tygxc, based it seems on his lack of understanding of the nature of the solution of checkers.
A weak solution strategy for white requires a response to EVERY legal move by black. None may be ignored, even if Steinitz didn't like them. That's the DEFINITION of a weak solution.
All perfect numbers are even
...and i think ending in 6 or 8 right ?...i mean so far ?
i LUV 127 !...as i heard it might be the only triple M prime out there...and i mean out there. u know. like all by itself ? kinda like me 
.
2ⁿ - 1 = 3 (n is 2)
2ⁿ - 1 = 7 (n is 3)
2ⁿ - 1 = 127 (n is 7)
2ⁿ - 1 = 170 141 183 460 469 231 731 687 303 715 884 105 727 (n is 127) ...or s/t like that
Jun 7, 2024
0
#8699
@tygxc never answer the question "if a computer checking x number of moves fail to find a win, how can you know a computer checking x +1 moves would also fail to find a win"?
Making the whole discusion about number of possibilities redundant
@11564
"they had two different players"
++ The ICCF WC Finals has 17 different players.