Is My Card Game Probability Calculation Correct?

  • Thread starter Thread starter jj975
  • Start date Start date
  • Tags Tags
    Game Probability
AI Thread Summary
The discussion revolves around calculating the probability that all five players in a card game receive the type A card matching their counter. The game involves 6 type A cards, 9 type B cards, and 6 type C cards, with one card of each type hidden. The proposed solution calculates the probability as (1/6)*(4/18)^3*(3/18)^2, considering the distribution of cards among players. There is confusion regarding whether the calculation is correct, especially in light of the fact that one player has two type A cards. The thread seeks validation of the probability calculation method used.
jj975
Messages
2
Reaction score
0
A card game involves dealing 3 types of cards to players. There are 6 type A cards, 9 type B cards and 6 type C cards. Each type A card has one matching counter.

In a game with 5 players, one card of each type is selected at random and hidden without knowledge. Each player then chooses a counter with one left over. All the remaining three types of card are combined, shuffled and dealt as evenly as possible to the players.

What is the probability that all of the 5 players have the type A card that matches their counter?




My solution:
Probability that the left over counter matches the hidden type A card = 1/6

18 of the three card types are dealt with three players receiving 4 cards and two players receiving 3 cards.

Probability of each player receiving the correct type A card = 4/18 and 3/18 respectively so the total probability that all players have the type A card matching their counter is
(1/6)*(4/18)^3 *(3/18)^2

Dues this seem correct to anybody? I was expecting this problem to be a lot harder so not sure if I'm missing something/done something wrong. Thanks in advance
 
Physics news on Phys.org
I would have thought that since one player has two cards of type A then the answer would simply be (1/6)*(1/5)*(1/4)*(1/3)
 
I was reading documentation about the soundness and completeness of logic formal systems. Consider the following $$\vdash_S \phi$$ where ##S## is the proof-system making part the formal system and ##\phi## is a wff (well formed formula) of the formal language. Note the blank on left of the turnstile symbol ##\vdash_S##, as far as I can tell it actually represents the empty set. So what does it mean ? I guess it actually means ##\phi## is a theorem of the formal system, i.e. there is a...

Similar threads

Replies
1
Views
1K
Replies
4
Views
2K
Replies
14
Views
2K
Replies
8
Views
1K
Replies
2
Views
2K
Replies
7
Views
2K
Replies
5
Views
2K
Back
Top