Alice 拥有 1,3,5,7 四张卡片,Bob 拥有 2,4,6,8 四张卡片,每轮游戏两人随机在自己的卡片中抽取一张,数字大的加一分,然后扔掉各自的卡片。问四轮后…
- User
Alice 拥有 1,3,5,7 四张卡片,Bob 拥有 2,4,6,8 四张卡片,每轮游戏两人随机在自己的卡片中抽取一张,数字大的加一分,然后扔掉各自的卡片。问四轮后 Alice 得分不小于 2 的概率。
- Assistant
To solve this problem, we'll begin by recognizing that Alice and Bob each have 4 cards. Alice has cards numbered 1, 3, 5, and 7, while Bob has cards numbered 2, 4, 6, and 8. Each round, both players randomly select one of their remaining cards and compare them, with the higher card winning a point for the owner. The cards used are then discarded.
We can model this game by considering all possible permutations of the order in which the players might play their cards. Because each player selects cards randomly, every possible order of their cards is equally likely. There are (4! = 24) possible orders for Alice's cards and 24 for Bob's cards, leading to a total of (24 \times 24 = 576) possible combined sequences.
However, due to the symmetry in the game (since both players are randomly ordering their cards), we can fix the order of one player's cards without loss of generality. Let's fix Alice's cards in ascending order: 1, 3, 5, 7. We'll then consider all 24 possible permutations of Bob's cards and calculate Alice's score in each case.
By systematically going through each permutation of Bob's cards and comparing them to Alice's fixed sequence, we tally how many times Alice wins each round. We find that:
- Alice scores 0 points in 1 permutation.
- Alice scores 1 point in 11 permutations.
- Alice scores 2 points in 11 permutations.
- Alice scores 3 points in 1 permutation.
Thus, there are 12 permutations where Alice scores at least 2 points out of the total 24 permutations of Bob's cards. This gives us the probability:
[ \text{Probability} = \frac{\text{Number of favorable permutations}}{\text{Total permutations}} = \frac{12}{24} = \frac{1}{2}. ]
Therefore, the probability that Alice scores at least 2 points after four rounds is (\dfrac{1}{2}).
(\boxed{\dfrac{1}{2}})