Question

There's a pack of cards with 13 cards that goes from A to K, A being...

There's a pack of cards with 13 cards that goes from A to K, A being the lowest of value and K being the highest. There are 2 players in the game Player 1 retrieved 6 cards from the pack (which he/she is allowed to look) and the rest of the cards goes in as a faced-down pile. Player 2 must draw 1 card at a time (without getting to look), and he stop if he thinks the card he held is the highest in the pile. If it's not the highest when he stop, Player 1 wins and vice versa.

a) How do Player 2 decide when to stop? How do he knows the next card he pick is the highest or not?

b) Post game, if you decide to play the game, will you be the one piling or the one choosing?

0 0
Add a comment Improve this question Transcribed image text
Answer #1

Let's call the following event X :A will definetly win if one of the six cards that he retrieved at the start is K. So probability of that happening is: Selecting K card, and selecting other 5 cards from the rest of the deck (12 cards:excluding K) i.e P(X) =  12 13. = 0.46

Event Z = Probability of Player 2 winning: 'Event X does not happen' AND 'He stops at the right card'

Event M = Probability that Player 2 stops at the right card.

Card K could be anywhere in the pile of 7 cards. Event M is essentially choosing the right card (i.e. K) out of 7 cards.

So P(M) = \frac{1}{7}

P(Z) = P(Xc{\bigcap }^{} M) = P(Xc) . P(M) = (1-0.46) x (0.143) = 0.077.

Since "Player 1 winning" and "Player 2 winning" are mutually exclusive and exhaustive events. Their respective probabilities sum to 1.

Event Y = Player 2 wins.

P(Y) = 1 - P(Z) = 0.923.

P(Player 1 wins) = P(Z) = 0.923

P(Player 2 wins) = P(Y) = 0.077

a.) Player 2 cannot possibly decide when to stop. For all he knows, the card K could not even be among the 7 cards faced-down pile. He cannot know if the next card that he picks is the highest or not. It's a probabilistic event in which he has to pick a correct card out of 7.

b.) Since,

P(Player 1 wins) = P(Z) = 0.923

P(Player 2 wins) = P(Y) = 0.077

I'll choose to pile because in that case probability of my winning will be very high.

Add a comment
Know the answer?
Add Answer to:
There's a pack of cards with 13 cards that goes from A to K, A being...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • 2 A Game of UNO You are to develop an interactive game of UNO between a...

    2 A Game of UNO You are to develop an interactive game of UNO between a number of players. The gameplay for UNO is described at https://www.unorules.com/. Your program should operate as follows. 2.1 Setup 1. UNO cards are represented as variables of the following type: typedef struct card_s { char suit[7]; int value; char action[15]; struct card_s *pt; } card; You are allowed to add attributes to this definition, but not to remove any. You can represent colors by...

  • the card game Acey Deucey, which is also known by several other names. In general, the...

    the card game Acey Deucey, which is also known by several other names. In general, the game is played with three or more people that continue to gamble for a pot of money. The pot grows and shrinks depending on how much General description of the game ● Two cards are dealt face up to a player from a shuffled deck of cards. ○ If the face of each card is the same then the player adds $1 into the...

  • Create a Java text-based simulation that plays baccarat between two players. In baccarat, there i...

    Create a Java text-based simulation that plays baccarat between two players. In baccarat, there is a banker and there is a player. Two cards are dealt to the banker and two cards to the player. Both cards in each hand are added together, and the objective (player) is to draw a two or three-card hand that totals closer to 9 than the banker. In baccarat, the card values are as follows: • 2–9 are worth face value • 10, J,...

  • The game of Nim: This is a well-known game with a number of variants. The following...

    The game of Nim: This is a well-known game with a number of variants. The following variant has an interesting winning strategy. Two players alternately take marbles from a pile. In each move, a player chooses how many marbles to take. The player must take at least one but at most half of the marbles. Then the other player takes a turn. The player who takes the last marble loses. Write a C program in which the computer plays against...

  • Please to indent and follow structure!!!!! Assignment 3 - The card game: War Due Date: June...

    Please to indent and follow structure!!!!! Assignment 3 - The card game: War Due Date: June 9th, 2018 @ 23:55 Percentage overall grade: 5% Penalties: No late assignments allowed Maximum Marks: 10 Pedagogical Goal: Refresher of Python and hands-on experience with algorithm coding, input validation, exceptions, file reading, Queues, and data structures with encapsulation. The card game War is a card game that is played with a deck of 52 cards. The goal is to be the first player to...

  • I need a basic program in C to modify my program with the following instructions: Create...

    I need a basic program in C to modify my program with the following instructions: Create a program in C that will: Add an option 4 to your menu for "Play Bingo" -read in a bingo call (e,g, B6, I17, G57, G65) -checks to see if the bingo call read in is valid (i.e., G65 is not valid) -marks all the boards that have the bingo call -checks to see if there is a winner, for our purposes winning means...

  • hello there, i have to implement this on java processing. can someone please help me regarding...

    hello there, i have to implement this on java processing. can someone please help me regarding that? thanks War is the name of a popular children’s card game. There are many variants. After playing War with a friend for over an hour, they argue that this game must never end . However! You are convinced that it will end. As a budding computer scientist, you decide to build a simulator to find out for sure! You will implement the logic...

  • While using JAVA , solve this. There are three basic classes we'll need this week: Card:...

    While using JAVA , solve this. There are three basic classes we'll need this week: Card: A class like the one presented in the modules, but with a few changes. Hand: A class that represents the cards held by a single player. Deck: A class that represents the source of the cards for dealing and, as the game progresses, the place from which players can receive new cards (say, as they pick cards "from the deck" or when future hands...

  • Please i need helpe with this JAVA code. Write a Java program simulates the dice game...

    Please i need helpe with this JAVA code. Write a Java program simulates the dice game called GAMECrap. For this project, assume that the game is being played between two players, and that the rules are as follows: Problem Statement One of the players goes first. That player announces the size of the bet, and rolls the dice. If the player rolls a 7 or 11, it is called a natural. The player who rolled the dice wins. 2, 3...

  • write up an essay on the problems in budgeting derived from the articles (i do Upvote...

    write up an essay on the problems in budgeting derived from the articles (i do Upvote the answers ) Why Budgeting Kills Your Company HBSWK Pub. Date: Aug '1 1, 2003 Why doesn't the budget process work? Read what experts say about not only changing your budgeting process, but whether your company should dispense with budgets entirely. by Loren Gary The average billion-dollar company spends as many as 25,000 person-days per year putting together the budget. If this all paid...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT