In that example, guesser bets b=2, and hider hides h=3, and guesser guesses odd. There is only one example where guesser guesses wrong.
Some comments claim otherwise.įrom examples in series it is not entirely clear to me either what the rule is. The video also gives the simple solution for that variant.Īnd presenter also mentions rules are not clear, but, most people, he says, believe 'h'. There is a YT video where rules are explained to be: if guesser guesses wrong, guesser must give amount 'h' that was hidden by hider, not amount 'b' bet by guesser. (series details coming so warning: spoiler ahead) On a side note: is this an old or new game? If it is a known old game, can anyone tell where its 'official' rules (and, maybe, solution(s)) are documented? We must assume both players know the starting conditions and are perfect mathematicians and logicians. Which strategies for both players (perhaps one strategy for the one who gets first turn, and one strategy for the other player) give maximal probabilities to win (and to not get killed). The losing player gets killed (in the series, that is).
The game stops when one player has all $2n=20$ marbles. Next, the turn now alternates to the other player. If guess is wrong, the player whose turn it is takes the amount of bet marbles from opponent. If guess is right, the player whose turn it is gives (as much as possible) the amount of bet marbles to opponent.
Every alternating turn, one player (say, the player whose turn it is) hides an amount of own marbles in fist, and, the other player must guess if hidden amount is odd or even, and, that other player (i.e., the player whose turn it is not) also must bet an amount of own marbles.