![(1 point) Three brothers play a game with a set of cards numbered 1 thru 10, they draw two cards with replacement and add the cards values. Scott will win if the sum of the cards is 13, Dave will win if 16, and Jim if 4. They will select 2 cards with replacement, then reshuffle until a winner is declared Part (a) What is the probability that on any particular two-card draw there is no declared winner? If rounding use at least five digits after the decimal. Part (b) Calculate the probability of Scott winning. If rounding use at least five digits after the decimal. Part (c) Realizing this, theoretically, is a game that could go on forever..the three brothers decide that if no winner has been decided in three, two-card draws or turns Scott will be deemed the winner. Let Y be the number of turns. If rounding use at least five digits after the decimal Complete the Probability distribution Y-y Someone wins on the first, two-card draw No win on first, two-card draw but someone wins on the second, two-card d P(Y y) EEi 0.1344 Part (d) The expected number of turns for this game to conclude is E Y]-2.5456. Find the Standard deviation of Y. ::: If rounding use at least five digits after the decimal. Part (e) Refer to part cIf a player lost S50 for each turn, but got $100 to play. How much money do you expect the player to win? Irounding use at least five digits after the decimal, if they expect to lose money use a negative. What is the absolute value of the standard deviation of the amount of money the player expects to win? If in](http://img.homeworklib.com/questions/c9a55280-715f-11ea-88c2-a98cdb1ce8aa.png?x-oss-process=image/resize,w_560)
Homework Answers
Add Answer to:
(1 point) Three brothers play a game with a set of cards numbered 1 thru 10,...
1 point) Three brothers play a game with a pair of fair (six-sided) dice. Scott will...
1 point) Three brothers play a game with a pair of fair (six-sided) dice. Scott will win if the sum of the dice is 3, Dave will win if 9, and Jim if 11 They will roll the die until a winner is declared Part (c) Realizing this, theoretically, is a game that could go on forever..the three brothers decide that if no winner has been decided in three rolls or "turns" Scott will be deemed the winner. Let Y...
Consider a play of the casino game `Quick Draw'. In this game, a player pays $11...
Consider a play of the casino game `Quick Draw'. In this game, a player pays $11 to play. The player picks one card from a standard pack of 52 cards (i.e. there are four A’s and four K’s in a standard pack of 52 cards). If the player gets an Ace, they win $50 but loose the amount they paid to play (the profit is revenue minus cost); if the player selects a King, they win $30 but loose the...
I am playing a simplified version of the card game, "War," with my brother. We are...
I am playing a simplified version of the card game, "War," with my brother. We are playing with a subset of the deck, all of the numbered cards 2 through 10 (2:10). There are 4 cards of each number, resulting in 36 total cards in a single pile. First, I turn over a card. Next, he turns over a card. Whoever has the higher card wins and these "used" cards are discarded. If we turn over the same card, we...
4. [6 marks] Consider a play of the casino game 'Quick Draw'. In this game, the...
4. [6 marks] Consider a play of the casino game 'Quick Draw'. In this game, the player pays $10 to play. He/she picks onē card from the standard deck of 52 cards (i.e. four A's, four K's, etc.). If the player selects an "A", he/she wins $50 (i.e. the profit is $40); if the player selects a "K", he/she wins $30 (i.e. the profit is $20). Otherwise, the player wins nothing and also loses the bet of $10. Let the...
War—A Card game Playing cards are used in many computer games, including versions of such classic...
War—A Card game Playing cards are used in many computer games, including versions of such classics as solitaire, hearts, and poker. War: Deal two Cards—one for the computer and one for the player—and determine the higher card, then display a message indicating whether the cards are equal, the computer won, or the player won. (Playing cards are considered equal when they have the same value, no matter what their suit is.) For this game, assume the Ace (value 1) is...
Program 4: C++ The Game of War The game of war is a card game played by children and budding comp...
Program 4: C++ The Game of War The game of war is a card game played by children and budding computer scientists. From Wikipedia: The objective of the game is to win all cards [Source: Wikipedia]. There are different interpretations on how to play The Game of War, so we will specify our SMU rules below: 1) 52 cards are shuffled and split evenly amongst two players (26 each) a. The 26 cards are placed into a “to play” pile...
(Game: play a tic-tac-toe game) In a game of tic-tac-toe, two players take turns marking an...
(Game: play a tic-tac-toe game) In a game of tic-tac-toe, two players take turns marking an available cell in a grid with their respective tokens (either X or O). When one player has placed three tokens in a horizontal, vertical, or diagonal row on the grid, the game is over and that player has won. A draw (no winner) occurs when all the cells in the grid have been filled with tokens and neither player has achieved a win. Create...
(1) Suppose you are to play a version of poker where you are dealt five cards...
(1) Suppose you are to play a version of poker where you are dealt five cards and win only if you are dealt a three of kind. That is, you win only when your five card hand contains a triple of the same rank, and two other cards each of different ranks than each other and different than the triple (examples: AAA94, 55579). If you win, you will win S100. If you lose, you have to pay some amount of...
Problem 4. (20 points) Pebbles Game. Two players play a game, starting with three piles of...
Problem 4. (20 points) Pebbles Game. Two players play a game, starting with three piles of n pebbles each. Players alternate turns. On each turn, a player may do one of the following: take one pebble from any pile take two pebbles each from two different piles The player who takes the last pebble(s) wins the game. Write an algorithm that, given n, determines whether the first player can "force" a win. That is, can the first player choose moves...
1. NIM game. This is a different version or easier version of NIM game Consider a pile of 5 matchsticks. Two people take turns removing 1 or 2 sticks each time from this pile. Suppose both players pl...
1. NIM game. This is a different version or easier version of NIM game Consider a pile of 5 matchsticks. Two people take turns removing 1 or 2 sticks each time from this pile. Suppose both players play smartly (nobody plays a fool move trying to let the opponent wins. But there is only one winner anyway) a)If the person getting the last stick wins, will the first player win? Why? Show the steps the first and second player will...
1 point) Three brothers play a game with a pair of fair (six-sided) dice. Scott will win if the sum of the dice is 3, Dave will win if 9, and Jim if 11 They will roll the die until a winner is declared Part (c) Realizing this, theoretically, is a game that could go on forever..the three brothers decide that if no winner has been decided in three rolls or "turns" Scott will be deemed the winner. Let Y...
4. [6 marks] Consider a play of the casino game 'Quick Draw'. In this game, the player pays $10 to play. He/she picks onē card from the standard deck of 52 cards (i.e. four A's, four K's, etc.). If the player selects an "A", he/she wins $50 (i.e. the profit is $40); if the player selects a "K", he/she wins $30 (i.e. the profit is $20). Otherwise, the player wins nothing and also loses the bet of $10. Let the...
(1) Suppose you are to play a version of poker where you are dealt five cards and win only if you are dealt a three of kind. That is, you win only when your five card hand contains a triple of the same rank, and two other cards each of different ranks than each other and different than the triple (examples: AAA94, 55579). If you win, you will win S100. If you lose, you have to pay some amount of...
Problem 4. (20 points) Pebbles Game. Two players play a game, starting with three piles of n pebbles each. Players alternate turns. On each turn, a player may do one of the following: take one pebble from any pile take two pebbles each from two different piles The player who takes the last pebble(s) wins the game. Write an algorithm that, given n, determines whether the first player can "force" a win. That is, can the first player choose moves...
1. NIM game. This is a different version or easier version of NIM game Consider a pile of 5 matchsticks. Two people take turns removing 1 or 2 sticks each time from this pile. Suppose both players play smartly (nobody plays a fool move trying to let the opponent wins. But there is only one winner anyway) a)If the person getting the last stick wins, will the first player win? Why? Show the steps the first and second player will...
Most questions answered within 3 hours.
-
An electric power station that operates at 25 kV and uses a 20:1
step-up ideal transformer...
asked 15 minutes ago -
1. If 0.02% of a 0.6 M weak acid ionizes in a solution, what is
the...
asked 2 minutes ago -
The College of Business at Northeast College is accumulating
data as a first step in the...
asked 8 minutes ago -
what is the ph of the following solutions?
150 g NH4CI dissolved into 10.0 mL of...
asked 5 minutes ago -
A flint glass plate (n = 1.66) rests on the bottom of an
aquarium tank. The...
asked 16 minutes ago -
The position in an object as a function of time is given as ?
(?) =...
asked 31 minutes ago -
Consider a different car. Its initial position at time 5 s is
5m, and it moves...
asked 13 minutes ago -
Discuss the sales orders process module(s) in the Enterprise
Resource Planning system. How does it contribute...
asked 31 minutes ago -
Which of the eight traits/ skills associated with being an
effective project manager is the most...
asked 15 minutes ago -
In the Metric System, the basic unit of measurement for length
is ___
In the Metric...
asked 22 minutes ago -
A spatially uniform electric field varies in time according
to E = Eo + 3000 t,...
asked 22 minutes ago -
A sample of C3H8 has 1.60×1024 H atoms.
How many carbon atoms does the sample contain?...
asked 28 minutes ago