Forums
Most Recent
 3/28/2017  FouldLang, New Zealand 1956
 Engines have no idea how to play chess ...
 Sneaky Game
 THE OPENINGS

The most popular opening
IM pfren
 Good mate in two (462)
 Symmetrical Grob: your suggestions
 Ilyumzhinov resigns...
 Sicilian: Double Nakamura Variation
 Is there an optimal chess training regimen?
Forum Legend
 Following
 New Comments
 Locked Topic
 Pinned Topic
Yes, but you were lucky for one move. Do you think you can be lucky for a long string of moves?
Techincally, yes. But realistically, no.
Yes, but you were lucky for one move. Do you think you can be lucky for a long string of moves?
Given a long enough amount of time, yes.
For such a phenomenon to repeat, the premise would have to be an infinite number of monkeys, with an infinite number of keyboards, and an infinite number of years.......
If the first two variables are infinite, then you don't need an infinite number of years. The work would be produced on the first attempt.
Infinite is a strange "number". You will even have an infinite amount of copies of the work, but it might be hard to find one between the infinite amount of crap...
For such a phenomenon to repeat, the premise would have to be an infinite number of monkeys, with an infinite number of keyboards, and an infinite number of years.......
If the first two variables are infinite, then you don't need an infinite number of years. The work would be produced on the first attempt.
Infinite is a strange "number". You will even have an infinite amount of copies of the work, but it might be hard to find one between the infinite amount of crap...
The fact that given an infinite amount of time, if something can happen, it will happen, proves that it's not impossible on the very next attempt. The odds however, can be so high against it, that for all practical purposes, you might as well say it's impossible. Though it can't ever be called virtually impossible. Just damn near impossible.
This probability argument is crap.
Even a 1300 would always (most of the time:) win to a random move generator.
Brownian movement & probability: your chessboard would jump in front of you...
Coming back to the original subject, a 1300 would never beat a 2700 player, except when pieces move alone, hahaha:)
yes f he wins luckly on time disconnection ect.
I think the only way to give this idea any validity, is to look at the term "rating" as an inaccurate rating.
If both players are well established FIDE or USCF players, having both have been playing recently, it would happen less often that you would win the Power Ball Lottery in the U.S.
If you are talking Chess.com players and one is new, I can think of a couple of different scenarios for how it is possible, but in either of them, it is still unlikely for the game to take place to begin with.
Easy. In the middle of the game, the 1300 player kills the GM. This also works with people with ratings near 0.
The biggest upset that I have ever see was when an 1100 beat a 1900, and that was only because the 1900 blundered. It is definately possible, but I would make the odds of it happening about 0.05%, about
1/2,000.
And now, think about the odds of winning the lottery:
1/200,000!?
But of course, I'm feeling lucky today, so I am somehow going to have that 1 in a Million (literally) opportunity to win. :) (This refers to both things I talked about.)
So, In reality, it will not happen.
Sorry to answer your quenstion with a question, but why did you even ask this? Do you have dreams to someday reach 1300, and then get lucky?
Sorry if that sounded rude.
I see no reason to comment further, since apparently the depth of the observation I offered a while ago has eluded the people I was trying to explain it to. Essentially, the argument I offered, and others said it with different words subsequently too, was that chess moves (or literary works) are subject to skill, and that GMs (or playwrights) don't flip a random coin to pick moves (or words), but use their good sense to reduce the number of options.
The observation that a coin flip may do better than a 1300level player is actually not unfounded, since a weak player would actively discard (as was already explained by others) or not even notice good move candidates, so his metaphorical "coin" will not even contain the set of good moves that are necessary to win against someone much stronger.
In other words, with a fair coin flipping machine used on every move and an infinite set of games (i.e., infinite time), it may indeed be possible to eventually arrive at a situation of picking the right set of moves. Still, the chance of that happening is so small (someone mentioned 1/30^40, which is close) that in practice no one will live long enough to experience this happening in our Universe.
The fact that it most likely wouldn't happen in the life of our universe has already been mentioned. But I still say the patzer would eventually accidentally make moves to counter the GM's best. Sooner or later. Even if it took millions of universes. Good night.
So the ultimate answer to the OP is:
Yes, there is a chance a 1300 can beat a 2700, but you'd more likely win the Powerball Lotto than see it happen in your lifetime (assuming the 2700 doesn't intentionally throw the game).
Right, an elephant steps on an ant enough times, and eventually the ant will win. Got it now :)
Right, an elephant steps on an ant enough times, and eventually the ant will win. Got it now :)
LOL  yes, you get it!
The whole premise of the question is flawed  a 1300 and a 2700 do not even play the same game.
Right, an elephant steps on an ant enough times, and eventually the ant will win. Got it now :)
LOL  yes, you get it!
The whole premise of the question is flawed  a 1300 and a 2700 do not even play the same game.
This idea has been proven many times by immunologists: If you kill something often enough, it will develop an immunity to death.
Right, an elephant steps on an ant enough times, and eventually the ant will win. Got it now :)
Actually elephants are scared of ants. So the elephant will usually resign even before the fight starts. And if the elephant tries anyway the "fight" will most likely end in a draw because the ant will find enough space under the elephants foot to survive.
In other words: it's one of the worst analogies I read on these forums so far
Valentin, your point is evident enough, so it's slightly odd that you feel the need to spell out in detail again that writing sentences and playing chess are not completely random endevours for humans. Of course that's not the case for our monkeys and our random move generator, so regrettably you remain incorrect with this one:
"However, this same argument cannot be applied with Shakespeare and chess  because the chance of winning a game depends on executing a sequence of strong moves (at least stronger than your opponent's). While a single strong move here and there might just come up for the beginner, it won't suffice in the end for winning, because the game is cumulative, i.e., the moves are not independent the same way that the numbers in the lottery are.
So I suggest studying some probability theory first before commenting on the subject of it!"
Again for simplicity, we can entirely put this in the context of flipping 10 heads. All we are doing is increasing the available desirable outcomes from say 2/17 (2 good moves, 15 bad) to 1/2 (we're calling a heads a 'good' move). Now, you would probably argue that this isn't a good analogy because we are only arbitrarily defining a head as a 'good' outcome, well here's the crux: in the game of chess, we are only arbitrarily defining certain moves as good moves. Of course chess is a complex game and there are countless reasons why we say certain moves are good and certain ones are bad. But this is exactly as unimportant as my reasons for desiring a string of heads over a string of tails when discussing probability.
In exactly the same way, there are many reasons why we define "Alas poor Yorick, I knew him well" as a more desirable outcome than "JIIU(*Y£(**HEWHOIOI"  but in the context of the infinite monkeys both are equally likely to occur, they will find both.
However, as you say, the element of skill does change things when we part with our monkeys or our random move generator. Again, putting this in the context of a coin toss  let's say I've developed a slight technique and I can hit heads 55% of the time. In one respect I am analogous to the 1300 player (though of course, the 1300 has much less than 55% chance of playing a good move), that is simply that I will most likely outperform pure chance. But the 2700 might be analogous to someone who could hit heads 80% of the time. He of course will be far more likely to string 10 heads together before the random coin or the 55%er. Nonetheless if we put these 3 partipants into endless strings of contest against each other, they will all be the first to hit 10 heads at some point.
A recurring response to this seems to be that a 1300 possesses so much misinformation about how to play chess that he will in fact do worse than the RMG. While it's true that his faulty logic will in many cases hold him back, I would argue that it's infinitely more true that the RMG's lack of any logic whatsoever will hold it back far more. A 1300 still likely understands opening prinicples, basic checkmate patterns, the concept of taking hanging pieces etc.. what does an RMG know? Absolutely nothing. People are imagining situations where the 1300 plays a move because of faulty logic, well in that case his faulty logic is just as likely to hit the 'right' move as the RMG, so long as it doesn't directly contradict the 'correct' logic. And why should we assume it does? Just imagine playing an RMG! It would be tedious to say the least.
And Valentin, the numbers in a lottery are very clearly not independent in the sense you are using it. You need to have a string of 5 (or is it 6?) numbers or you might as well have nothing, so in that sense they are required to cumulate. You must be being terribly misled by the fact it doesn't matter in what order they come
On another note, arguments involving physical parameters such as the mosquito having a chance to survive an elephant's foot, or me having the chance to outrun Usain Bolt are misleading. Again the probabilites are nonzero (yet for many reasons, incalculable), but in these cases we are involving the laws of physics, which tend to resist being broken.
Right, an elephant steps on an ant enough times, and eventually the ant will win. Got it now :)
LOL  yes, you get it!
The whole premise of the question is flawed  a 1300 and a 2700 do not even play the same game.
Ok, I understand your point, and I do agree that there is a 0% chance the ant will win with his own strength, but alas, that doesn't apply here.
All we need to know is that a 1300 player is capable of seeing a simple blunder sometimes and taking advantage of it, and a 2700 player is capable of making it. It's extremely unlikely, but again, possible.
"Still, the chance of that happening is so small (someone mentioned 1/30^40, which is close) that in practice no one will live long enough to experience this happening in our Universe."
We agree. At least about the random number generator. That's all we want to know  is it possible.
It has already been brought up that there are drawbacks to the 1300's nature of not making random moves in terms of the question, but it has already been addressed that despite these drawbacks, you're still probably better off being a 1300 than a random number generator.