In the land of Puzzlevania, Aaron, Bob, and Charlie had an argument over which one of them was the greatest puzzle-solver of all time. To end the argument once and for all, they agreed on a duel to the death. Aaron was a poor shot and only hit his target with a probability of 1/3. Bob was a bit better and hit his target with a probability of 1/2. Charlie was an expert marksman and never missed. A hit means a kill and the person hit drops out of the duel. To compensate for the inequities in their marksmanship skills, the three decided that they would fire in turns, starting with Aaron, followed by Bob, and then by Charlie. The cycle would repeat until there was one man standing. That man would be remembered for all time as the Greatest Puzzle-Solver of All Time. An obvious and reasonable strategy is for each man to shoot at the most accurate shooter still alive, on the grounds that this shooter is the deadliest and has the best chance of hitting back.
Write a
An alternate strategy is for Aaron to intentionally miss on his first shot. Modify the program to accommodate this new strategy and output the probability of winning for each contestant. What strategy is better for Aaron, to intentionally miss on the first shot or to try and hit the best shooter?
Want to see the full answer?
Check out a sample textbook solutionChapter 4 Solutions
Absolute C++, Student Value Edition, 6/e
Additional Engineering Textbook Solutions
Objects First with Java: A Practical Introduction Using BlueJ (6th Edition)
Database Concepts (8th Edition)
Starting Out with C++: Early Objects (9th Edition)
Starting Out with Java: From Control Structures through Objects (7th Edition) (What's New in Computer Science)
Web Development and Design Foundations with HTML5 (9th Edition) (What's New in Computer Science)
Java How to Program, Early Objects (11th Edition) (Deitel: How to Program)
- The world monarch in the new post-apocalyptic world is extremely worried about the birth rate. She therefore orders that every family must have at least one female or else pay hefty fines. What will the gender ratio of the next generation be if all families adhere to this policy, which requires them to keep having children until they have one girl, at which time they immediately stop? (Presume that all pregnancies have an equal chance of producing a male or a girl.) Write a computer simulation of this problem after you have rationally resolved it.arrow_forwardThe game Capture is played by two players, First and Second, who take turns to move towards one another on a narrow bridge. Initially, the two players are at opposite ends of the bridge, at a distance of n feet from each other. (Here n is an arbitrary positive integer.) When it is their turn, they are allowed to jump 1, 2, or 3 feet toward each other. The game starts by First making a move first; the game is over when one player is able to capture (jump on top of) the other player. Generalize the problem further to the case when the initial distance is n feetand the players are allowed to jump any (positive) integer number of feet up to k feet. (Here n and k are arbitrary natural numbers.)arrow_forwardThe world queen in the new post-apocalyptic world is extremely worried about the birth rate. She therefore orders that every family must have at least one daughter or else pay hefty fines. What will the gender ratio of the next generation be if all families adhere to this policy, which requires them to keep having children until they have one girl, at which point they immediately stop? (Presume that all pregnancies have an equal chance of producing a boy or a girl.) Write a computer simulation of this problem when you have logically resolved it.arrow_forward
- In a classroom election, two presidential candidates, namely, Lisa and Teddy, both garnered the same number of total votes. As such, they decided to play a custom dice game to determine the winner of the election. In this game, a player needs to roll a pair of dice. Teddy will win the game if the sum is odd whereas Lisa will be declared winner if the sum results to even. However, prior to the start of the game, Teddy complained that the custom dice game is biased because according to him, the probability of an even result is 6/11, and for odd - only 5/11. Verify Teddy's claim and evaluate the fairness of the game. CLEAR SOLUTIONarrow_forwardIn a classroom election, two presidential candidates, namely, Lisa and Teddy, both garnered the same number of total votes. As such, they decided to play a custom dice game to determine the winner of the election. In this game, a player needs to roll a pair of dice. Teddy will win the game if the sum is odd whereas Lisa will be declared winner if the sum results to even. However, prior to the start of the game, Teddy complained that the custom dice game is biased because according to him, the probability of an even result is 6/11, and for odd - only 5/11. Verify Teddy's claim and evaluate the fairness of the game. A. The game is fair. B. The game is unfair to Lisa. C. The game is unfair to Teddy. D. More information is needed. complete solutionarrow_forwardIn a classroom election, two presidential candidates, namely, Lisa and Teddy, both garnered the same number of total votes. As such, they decided to play a custom dice game to determine the winner of the election. In this game, a player needs to roll a pair of dice. Teddy will win the game if the sum is odd whereas Lisa will be declared winner if the sum results to even. However, prior to the start of the game, Teddy complained that the custom dice game is biased because according to him, the probability of an even result is 6/11, and for odd - only 5/11. Verify Teddy's claim and evaluate the fairness of the game. COMPLETE SOLUTIONarrow_forward
- Suppose you are a participant in a game show. You have a chance to win a motorbike. You are askedto select one of the 500 doors to open; the motorbike is behind one of the 500 doors; the other remaining doorsare losers and have balloons behind them. Once you select a door, the host of the game show, who knowsexactly what is behind each of the door, randomly opens 480 of the other doors all at once that s/he for sureknows are losing doors and have balloons behind them. Then s/he reoffers you – whether you would like toswitch to the other doors or keep your initial or original selection as before. Now in this case, you are goingto make decision based on probabilistic reasoning. Therefore, whenever you are reoffered by the host to dothe selections among the remaining unopened doors, what is the probability of winning for each of theremaining unopened doors (including your original selection)? Do you want to make a switch based on theprobabilistic reasoning? If you are switching, which…arrow_forwardJack and Jill will play a game called Hotter, Colder. Jill chooses a number from 0 to 100, and Jack makes repeated attempts to guess it. For each guess, Jill will respond with: hotter - if the current guess is closer to her number than the previous guess is colder - if the current guess is farther to her number than the previous guess is same - if the current guess is as far (to her number) as the previous guess is For Jack’s first guess, since there is no previous guess yet, Jill will just answer same. Describe an algorithm or a systematic approach that Jack can follow to win the games faster (fewer guesses). Example: Jill chooses number 40. Note: Jack can guess any number from 0 to 100 at any point of the game. Jack guesses 100. Jill responds same (first guess) Jack guesses 60. Jill responds hotter (60 is closer to 40 than previous guess 100) Jack guesses 80. Jill responds colder (80 is farther from 40 than previous guess 60) Jack guesses…arrow_forwardConsider the two mathematical statements: The known integers to all of us are all rational numbers. The real number √2 can not be represented as p/q, where p, q are integers.Achieve the below set of conclusion by using all the rules of inference taught in class:(a) √2 is not an integer(b) There exists at least one real number but not a rational number(c) It is not the case that all the numbers we know are both real number and integer numberarrow_forward
- Suppose a person can buy a chocolate bar from the vending machine for $1 each. Inside every chocolate bar is a coupon. A person can redeem 3 coupons for one chocolate bar from the machine. This means that once a person has started buying chocolate bars from the machine, he/she always has some coupons. A person would like to know how many chocolate bars can be bought, if a person starts with N dollars and always redeem coupons, if he/she has enough for an additional chocolate bar. For example: With 3 dollars a person could buy 4 chocolate bars after purchasing 3 bars giving him/her 3 coupons and then redeeming the 3 coupons for one bar. This would leave him/her with one extra coupon. Thus, will have 4 chocolate bars and still have one coupon leftover. For 11 dollars, a person can have 16 chocolate bars and still have one coupon leftover. For 12 dollars, a person can have 17 chocolate bars and have two coupons leftover. Write a complete Python program that prompts a buyer to input…arrow_forwardImplement an algorithmic solution, indicating which states are valid and which are not, and model the space of the following problem: An interest group from a small town decided to sue a company for commercial abuse. For this, the people have organized themselves and decided to send 3 representatives, who will have to travel in a Van to the city where the lawsuit will be filed. The company to be sued, upon learning of these actions, has decided to send 3 lawyers to persuade the representatives, who will also travel in the same Van for that purpose. The community must file the class action suit under these conditions: - The three applicants must reach the destination city; - Only two people can travel per trip in the Van (small town - city, city - small town); - There can never be more lawyers than plaintiffs in any one place (either in the small town or city) because the lawyers can persuade the plaintiffs and as a consequence, the lawsuit would not be made; - The Van cannot be…arrow_forwardOn the Island of Knights and Knaves we have two people A and B. A says: Exactly one of us is a knight if and only if B is a knight. B says: A is a knight if I’m a knight. determine if A and B are each a knight or a knave. (The problem might have no solutions, one solution, or many solutions.)arrow_forward
- Operations Research : Applications and AlgorithmsComputer ScienceISBN:9780534380588Author:Wayne L. WinstonPublisher:Brooks Cole