4 ms·
The thing is, if you are playing randomly, that makes it easier to predict what you’re (not) going to do next. A good random distribution would give fewer runs,
by jchw 7y ago
The thing is, if you are playing randomly, that makes it easier to predict what you’re (not) going to do next. A good random distribution would give fewer runs, which means your choice is less likely to be the last choice you picked and somewhat less likely to be other recent values. It can at least tie by choosing scissors if it thinks you will not pick rock.
This is kind of a shot in the dark because I am not familiar with RPS strategy, but I think it makes sense.
- mbrumlow 7y agoBut if it predicts you are playing random, is it not then random vs random? I am under the impression that you can't game random -- unless you are aware of the random generator being used is broken..
- vinceguidry 7y agoIf you made random moves in a game of chess or checkers you'd get beat by a four year old with the barest grasp of the rules. In fact I would love to see a chess-playing robot that actually does that, it would thrill the crap out of my nephews to beat the big bad robot in a game of wits. I'm unaware of the name of the property that RPS exhibits that makes it ungameable by a random opponent (zero-sum?) but ordinary RPS played by humans certainly doesn't exhibit it, only in the magic world of computers where things like simultaneity of play can be guaranteed does RPS exhibit that property. If played in the real world like real humans traditionally played it, ongoing RPS matches between a human and an AI would soon see the AI dominating. I'd be very curious to see what real-world RPS would look like between two AIs that can 'explain their model'. Imagine making a rule that gives a Xms window for making plays. Then strategy can start to emerge.
- mbrumlow 7y agoThis is not chess. But a game of chance. You can't form a strategy based off random without predicting said random. I thik it was already pointed out but I have not had a chance to verify. This game uses your played move in tht training set to train before making it's predictions.
- vinceguidry 7y agoRPS is not a game of chance. Outcomes of games are determined not by a random process, but by the choices of the players. If the players rolled dice and biggest roll wins, that's a game of chance. The dice can't pick how they're thrown, nor can the throwers influence the outcome. If either of those two things change, the game is no longer purely one of chance. The game can be set up in many ways that invite strategy. If they set up a camera and watched the human playing out the moves physically, that lets the algorithm read the person's patterns the way a human might read someone's poker tell.
- mbrumlow 7y agoIt becomes a game of chance once one of the players is replaced with a computer picking at random. Which is the point of this thread. Random vs AI.
- vinceguidry 7y agoThat's gotta be the most boring discussion ever. I guess I'll leave you to it.
- kqr 7y agoAre you implying that you can (or any other human can) in the long run beat someone who is playing RPS randomly?
- vinceguidry 7y agoCan I beat a computer playing randomly, no. A human, show me where the random number generator in their brain is.
- mbrumlow 7y agoI see the confusion now. The entire point of this thread is that some of use pitted random vs this AI. And tht AI is winning more often than it should. Zero humans were involved. Which brings us back to you can't game random.
- seanhunter 7y ago2 person adversarial games with hidden information (eg poker or RPS) exhibit a "Nash equilibrium in mixed strategies". That is, the best strategy involves a random selection between choices with some probability weights. Since RPS is a very simple game, the weights are equal, so the unbeatable strategy is to choose between rock, paper and scissors with uniform probability on each round taking no account of what you or the other player have played before. Any other strategy can be exploited to the extent it deviates from pure uniform random choice (eg trivially the classic "play the thing that would have beat the thing which beat the winner of the previous round" strategy in RPS which you can use to reliably destroy children at the game). Games with complete information (eg noughts and crosses, chess, go etc) have "pure strategies" (ie randomness is not required and there should always be an absolute best move in any given situation which you should pick 100% of the time). Here's an intro to the concept of Nash equilibrium in mixed strategies http://www.econport.org/content/handbook/gametheory/useful/equilibrium/nashmixed.html http://www.econport.org/content/handbook/gametheory/useful/e... Edit: In case it's not clear, the hidden information in RPS is the opponent's move. Whereas in chess you are either starting the game or you know what the opponent has done, in RPS you move simultaneously with the opponent, so don't know their move.
- vinceguidry 7y agoThe Internet truly is a horn of plenty. Thanks for granting my nerd wish!
- ps101 7y agoThe Nash-Equilibrium solution to RPS is playing each option a third of the time. Simplified, this means that if you're playing this strategy, your opponent's best strategy is to do the same and there is nothing either of you can do to increase your own expectation.
- mbrumlow 7y agoThis thread is talking about playing random -- by aid of a computer providing random numbers. The result is just that -- 1/3 of the time each option is played. The issue here is this AI is able to best random, and that is not something that should happen.
- EGreg 7y agoThat sounds like the gambler’s fallacy. Less runs than what? Most truly random input haa far more runs than what people “think” is random, and in fact that’s one of the statistical tests for whether a data set was random. You’re essentially saying that a good neural network can predict the next value of a good random number generator. Good luck with that one! Maybe while you’re at it, have neural networks invert cryptographically secure hash functions :)
- jchw 7y agoHere’s what I’m thinking: The neural network doesn’t have to be correct about which one you pick, it has to be correct about which you don’t pick. Only one option they pick is a loss, so if the other party can be somewhat certain you won’t pick a specific option, it can at least tie. So if a randomizer has pretty even distribution, I think it can win more than half the time, because it can gather roughly how likely the same choice is to be played in a row. I’m basically suggesting a predictable distribution can be exploited in RPS. Honestly, the bot could always be winning against the RNG by dumb luck. More experimentation would be needed to be sure. I am just making guesses.
- misterman101 7y ago> I think it can win more than half the time, because it can gather roughly how likely the same choice is to be played in a row. With a random choice, the chance of playing the same choice in a row is 1/3. This does not give you any advantage over having no information (where each choice has a 1/3 chance.) I think the misunderstanding is in > a randomizer has pretty even distribution Having an even distribution over a long time does not make any specific choice less random. https://en.wikipedia.org/wiki/Gambler%27s_fallacy https://en.wikipedia.org/wiki/Gambler%27s_fallacy
- p1necone 7y agoHere's a thought experiment that might help: imagine what you say is truly the case - that would mean you could "charge up" a dice by rolling it until you got a long run of a given number - lets pick something arbitrary, say you roll until you get 5 twos in a row. According to what you've said the chance of the next number rolled being a two is now lower than it was when you started "charging up" your dice. How is this possible? Nothing is physically changing about the dice between rolls.
- seanhunter 7y agoRandom specifically doesn't mean it's less likely to be the last choice you picked. At least if we're talking uniform random which we should be here. It means the last choice you picked is exactly as likely as any other choice.
- wongarsu 7y ago> A good random distribution would give fewer runs A good random distribution actually gives more and longer runs than a human trying to appear random.