Monshimout is a game from the Cheyenne people and played by women. It could be played...
Monshimout is a game from the Cheyenne people and played by
women. It could be played by two or more players, and if played by
more than two, then the players divided into two equal teams.
Game equipment consisted of five plum stones and a basket made of
woven grass or willow twigs. The basket measured 3-4 inches deep, 8
inches across at the top, and almost 1/2 inch thick. The plum
stones were left plain on one side, but marked on the opposite
side. Three were marked using a pattern similar to markings the
women used when painting their face: a cross (used on the bridge of
the nose), and side marks (used on cheeks, forehead, and chin). The
other two stones were marked with a representation of a bear's
foot.
The players sat opposite each other, in two rows if more than one
player. Each player has eight sticks which represent the points she
must score to win. When a player has won all the sticks belonging
to her opponent she has won the game and the stakes wagered. If
teams are playing, each member wins or loses according to the
winnings or losses of the teammate in control of the basket and
stones.
A throw of the stones is done this way. The stones are placed into
the basket and the basket is raised slightly and the stones tossed
only a few inches and caught in the basket. The basket is then
brought down firmly onto the ground so that it strikes the ground
with a slight noise. The manner in which the stones land in the
basket determine the points scored or lost, as well the control of
the throw. A player continues to throw so long as she throws a
scoring toss, if she throws a toss with no score the throw passes
to her opponent or to the next player. If teams are playing it
passes to the thrower's teammate and continues as such until the
last teammate throws. If the last member of a team throws a zero
score the throw passes to the opposing team.
The scoring is as follows:
5 blanks = 1 (the thrower takes 1 stick)
3 blanks, 2 bears = 1 (thrower takes 1 stick)
2 bears, 2 crosses, 1 blank = 1 (thrower takes 1 stick)
2 blanks, 3 crosses = 3 (thrower takes 3 sticks)
2 bears, 3 crosses = 8 (thrower takes 8 sticks and wins game)
Assuming that each stone has equal chance of landing on either
side, compute the following:
The probability of 5 blanks: =
The probability of 3 blanks, 2 bears: =
The probability of 2 bears, 2 crosses and 1 blank:
=
The probability of 2 blanks, 3 crosses: =
The probability of 2 bears, 3 crosses: =
Consider the probability distribution of possible points X given
below:
| Xi | 0 | 1 | 3 | 8 |
| P(X=Xi) | P(X=0) | P(X=1) | P(X=3) | P(X=8) |
Find the following:
P(X=0) =
P(X=1) =
P(X=3) =
P(X=8) =
Homework Answers
Add Answer to:
Monshimout is a game from the Cheyenne people and played by women. It could be played...
Develop a game using Matlab. Work in groups of two. A Game of Sticks The rules...
Develop a game using Matlab. Work in groups of two. A Game of Sticks The rules are as follows: Players: 2 Sticks: 20 Players take turns sequentially to pick 1~3 sticks. Loser picks up the last stick! This project has the following deliverables: (1) Your project implements a 2-player version of the game of sticks in the command window. Required display in command window: ‘Welcome to the game!’ ‘Please enter player 1 name:’ ‘Please enter player 1 name:’ ‘Player 1...
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...
#The game HORSE is a popular basketball shooting game. #It can be played with any number...
#The game HORSE is a popular basketball shooting game. #It can be played with any number of players. One-by-one, #each player takes a shot from anywhere they want. If they #make the shot, the next person must make the same shot. #If they do not, they receive a letter: H, then O, then R, #then S, then E. Once a player receives all 5 letters, they #are out of the game. # #The game continues until all but one player...
Developing an optimal strategy for a variant of the game Nim Nim is a subtraction game...
Developing an optimal strategy for a variant of the game Nim Nim is a subtraction game that is played with sticks. The subtraction game variant is simple. A pile of sticks is placed in front of a pair of participants. The players take turns removing either 1, 2, 3, or 4 sticks from the pile. The player who removes that last stick from the pile loses the game. It turns out that there is an optimal strategy for playing this...
Problem: Pick Up Sticks For this assignment you will be creating an interface for two humans...
Problem: Pick Up Sticks For this assignment you will be creating an interface for two humans to play a simple game of "Pick Up Sticks". Here's how the game is played in the "real world": The game begins with a number of sticks on a table (between 10 and 100) Each player, in turn, takes between 1-3 sticks off the table. The player to take the last stick loses. Your job is to build a virtual version of the game...
1. NIM game is a game with multiple piles of match sticks with the two players...
1. NIM game is a game with multiple piles of match sticks with the two players taking turns to remove 1 pile or part of 1 pile. The person getting the last stick wins. In the class I had shown how (1, 1) and (2, 2) are losing configurations (i.e. the person facing two piles of 2 and 2 sticks will lose). a) Prove that (3, 4) is a winning configuration. Show how the 1s player can win if she...
Answer the following Nim game style questions. (Robert's Game) In this game, two players take turns removing stones from a pile that begins with n stones. The player who takes the last stone w...
Answer the following Nim game style questions.
(Robert's Game) In this game, two players take turns removing stones from a pile that begins with n stones. The player who takes the last stone wins. A player removes either one stone or p stones, where p is a prime dividing the number of stones in the pile at the start of the turn For which n does the First Player have a winning strategy? A winning strategy for the First Player...
Consider a variant of the Nim game called "Stones". Suppose that initially there is a single...
Consider a variant of the Nim game called "Stones". Suppose that initially there is a single pile of 5 stones and two players, I and II. Each player takes turns picking up either 1 or 2 stones from the pile. Player I moves first, then Player II, then Player I, etc. until all stones have been picked up 3. Assuming that the loser is the player who picks up the last stone, write the game of Stones out in extensive...
Consider a game being played between player 1 and player 2. Player 1 can choose T...
Consider a game being played between player 1 and player 2. Player 1 can choose T or B. Player 2 can take actions Lor R. These choices are made simultaneously. The payoffs are as follows. If 1 plays T and 2 plays L, the payoffs are (0,0) for Player 1 and 2, respectively. If 1 opts of B and 2 L, the payoffs are (5,7). If 1 plays T and 2 R, the payoffs are (6,2). Finally, both players get...
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...
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. NIM game is a game with multiple piles of match sticks with the two players taking turns to remove 1 pile or part of 1 pile. The person getting the last stick wins. In the class I had shown how (1, 1) and (2, 2) are losing configurations (i.e. the person facing two piles of 2 and 2 sticks will lose). a) Prove that (3, 4) is a winning configuration. Show how the 1s player can win if she...
Answer the following Nim game style questions.
(Robert's Game) In this game, two players take turns removing stones from a pile that begins with n stones. The player who takes the last stone wins. A player removes either one stone or p stones, where p is a prime dividing the number of stones in the pile at the start of the turn For which n does the First Player have a winning strategy? A winning strategy for the First Player...
Consider a variant of the Nim game called "Stones". Suppose that initially there is a single pile of 5 stones and two players, I and II. Each player takes turns picking up either 1 or 2 stones from the pile. Player I moves first, then Player II, then Player I, etc. until all stones have been picked up 3. Assuming that the loser is the player who picks up the last stone, write the game of Stones out in extensive...
Consider a game being played between player 1 and player 2. Player 1 can choose T or B. Player 2 can take actions Lor R. These choices are made simultaneously. The payoffs are as follows. If 1 plays T and 2 plays L, the payoffs are (0,0) for Player 1 and 2, respectively. If 1 opts of B and 2 L, the payoffs are (5,7). If 1 plays T and 2 R, the payoffs are (6,2). Finally, both players get...
Most questions answered within 3 hours.
-
A block is hung by a string from the inside roof of a van. When
the...
asked 1 minute ago -
Do you think companies should not go for long term debt in their
capital structure to...
asked 10 minutes ago -
I create an address book where the user enters the name, phone
and email in the...
asked 16 minutes ago -
The production capacity for acrylonitrile
(C3H3N) in the United States exceeds 2
million pounds per year....
asked 24 minutes ago -
explain and comment out your answer
43. How many address lines are required to address a...
asked 30 minutes ago -
A sample of 45 observations is selected from a normal
population. The sample mean is 49,...
asked 45 minutes ago -
A construction company is planning to bid on a building
contract. The bid costs the company...
asked 42 minutes ago -
A firm operating in a purely competitive environment is faced
with a market price of $250....
asked 49 minutes ago -
•Let’s say someone claims the average population size is
600 feet squared and the housing authority...
asked 56 minutes ago -
Cynaide is a deadly poison that blocks the last step in the
electron transport chain of...
asked 1 hour ago -
Your friend tells you that there is a vending machine on campus
that dispenses M&M packs...
asked 1 hour ago -
What advantages are there to using piperidine rather than
hydroxide as a base?
asked 1 hour ago