Microsoft Visual C#
7th Edition
ISBN: 9781337102100
Author: Joyce, Farrell.
Publisher: Cengage Learning,
expand_more
expand_more
format_list_bulleted
Videos
Textbook Question
Chapter 4, Problem 8E
In the game Rock paper Scissors, two players simultaneously choose one of three options: rock, paper, or scissors. If both players choose the same option, then the result is a tie. However, if they choose differently, the winner is determined as follows:
• Rock beats scissors, because a rock can break a pair of scissors.
• Scissors beats paper, because scissors can cut paper.
• Paper beats rock, because a piece of paper can cover a rock.
Create a game in which the computer randomly chooses rock, paper, or scissors. Let the user enter a character, r, p, or s, each representing one of the three choices. Then, determine the winner. Save the application as RockPaperScissors.cs.
Expert Solution & Answer
Trending nowThis is a popular solution!
Students have asked these similar questions
In the game Rock Paper Scissors, two players simultaneously choose one of three options: rock, paper, or scissors. If both players choose the same option, then the result is a tie. However, if they choose differently, the winner is determined as follows:
Rock beats scissors, because a rock can break a pair of scissors.
Scissors beats paper, because scissors can cut paper.
Paper beats rock, because a piece of paper can cover a rock.
Create a game in which the computer randomly chooses rock, paper, or scissors.
Let the user enter a number 1, 2, or 3, each representing one of the three choices.
Then, determine the winner.
Program should validate all user input
Game should ask the user to play again and continue if yes and stop if no.
Once the user stops playing, program should print the total number of wins.
In the game Rock Paper Scissors, two players simultaneously choose one of three options: rock, paper, or scissors. If both players choose the same option, then the result is a tie. However, if they choose differently, the winner is determined as follows:Rock beats scissors, because a rock can break a pair of scissors.Scissors beats paper, because scissors can cut paper.Paper beats rock, because a piece of paper can cover a rock.Create a game in which the computer randomly chooses rock, paper, or scissors.Let the user enter a number 1, 2, or 3, each representing one of the three choices.Then, determine the winner.Program should validate all user inputGame should ask the user to play again and continue if yes and stop if no.Once the user stops playing, program should print the total number of wins.
The first application you will complete simulates a fight with the mythical greek hydra. As legend goes, if you were to chop off the head of a hydra, two smaller heads would grow back in its place. In order for our fight to have an end, we will assume that once the size of the targeted head is small enough, no new heads will grow back in its place. The goal of this application is to determine the amount of work required to kill a hydra with a single head, when the size of the head is given as input.
Final output would look like this
The head bag is Bag[ 3 ]The head bag is Bag[ 2 2 ]The head bag is Bag[ 2 1 1 ]The head bag is Bag[ 2 1 ]The head bag is Bag[ 2 ]The head bag is Bag[ 1 1 ]The head bag is Bag[ 1 ]The head bag is Bag[ ]The number of chops required is 7Run the program again using 4 for the size of the initial head. The work done should be 15.Run the program again using 5 for the size of the initial head. You should get the computation ended early.Run the program again using 6…
Chapter 4 Solutions
Microsoft Visual C#
Ch. 4 - What is the output of the following code...Ch. 4 - What is the output of the following code...Ch. 4 - Prob. 3RQCh. 4 - If the following code segment compiles correctly,...Ch. 4 - What is the output of the following code...Ch. 4 - What is the output of the following code...Ch. 4 - What is the output of the following code...Ch. 4 - What is the output of the following code...Ch. 4 - Which of the following expressions is equivalent...Ch. 4 - Which of the following expressions assigns true to...
Ch. 4 - Which of the following expressions is equivalent...Ch. 4 - How many case labels would a switch statement...Ch. 4 - Prob. 13RQCh. 4 - Prob. 14RQCh. 4 - Which of the following is equivalent to the...Ch. 4 - Which of the following C# expressions is...Ch. 4 - Which of the following C# expressions means, If...Ch. 4 - Prob. 18RQCh. 4 - Prob. 19RQCh. 4 - Which of the following C# expressions results in...Ch. 4 - Write a program named CheckCredit that prompts...Ch. 4 - Write a program named Twitter that accepts a users...Ch. 4 - Write a program named Admission for a colleges...Ch. 4 - The Saffir-Simpson Hurricane Scale classifies...Ch. 4 - a. Write a program named CheckMonth that prompts a...Ch. 4 - Account numbers sometimes contain a check digit...Ch. 4 - Write a program named GuessingGame that generates...Ch. 4 - In the game Rock paper Scissors, two players...Ch. 4 - Create a lottery game application named Lottery....Ch. 4 - Each of the following files in the Chapter.04...Ch. 4 - In Chapter 2, you created an interactive...Ch. 4 - In Chapter 2, you created an interactive...
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
- Create a Minesweeper game that is text-based. Minesweeper is a classic single-player computer game in which a NxN grid contains B mines (or bombs) hidden throughout. The remaining cells are either blank or contain a number. The numbers represent the number of bombs in the eight surrounding cells. The user then finds a cell. If it's a bomb, the player is out.If it is a number, it is displayed. If it is a blank cell, it is exposed, as are all adjacent blank cells (up to and including the surrounding numeric cells). When all non-bomb cells are exposed, the player wins. The player can also mark specific locations as potential bombs.This doesn't affect gameplay, other than to block the user from accidentally clicking a cell that is thought to have a bomb.(Tip for the reader: if you're not familiar with this game, please play a few rounds on line first.)arrow_forwardNim is a two-player game played with several piles of stones. You can use as many piles and as many stones in each pile as you want, but in order to better understand the game, we'll start off with just a few small piles of stones (see figure 1 below). Pile 1 Pile 1 Pile 2 The two players take turns removing stones from the game. On each turn, the player removing stones can only take stones from one pile, but they can remove as many stones from that pile as they want (please note, a player must remove atleast 1 stone from a pile during his/her turn). If they want, they can even remove the entire pile from the game! The winner is the player who removes the final stone (avoid taking the last stone - see figure 2 below). Pile 2 Pile 3 Pile 3 Let's say its Max (player 1) turn to play. Then Max can win by simply removing a stone from Pile 2 or Pile 3 Draw a game tree (upto depth level 2) for the given version of the Nim game. Please consider figure 1 as your initial game configuration/state…arrow_forwardYou are hired by a game design company and one of their most popular games is The Journey. The game has a ton of quests, and for a player to win, the player must finish all the quests. There are a total of N quests in the game. Here is how the game works: the player can arbitrarily pick one of the N quests to start from. Once the player completes a quest, they unlock some other quests. The player can then choose one of the unlocked quests and complete it, and so on. For instance, let’s say that this game had only 4 quests: A, B, C, and D. Let’s say that after you complete • quest A, you unlock quests [B, D]. • quest B, you unlock quests [C, D]. • quest C, you unlock nothing [ ]. • quest D, you unlock quest [C]. Is this game winnable? Yes, because of the following scenario: The player picks quest A to start with. At the end of the quest A, the unlocked list contains [B, D]. Say that player chooses to do quest B, then the…arrow_forward
- Pig is a game that has two players that alternate turns rolling dice. In this case, there will be one human player and one computer player. Each player’s goal is to get 100 points rolled on a normal six-sided die first. Each turn consists of rolling the die repeatedly until you decide to stop or until you roll a 1. For each roll: • If you roll a 2, 3, 4, 5, or 6 –you will add the amount rolled to your score.• If you roll a 1 – your turn ends and you receive zero points for that entire turn (You will keep whatever points you had before your turn started)• If you decide to stop rolling at any point in your turn, your points for that turn are then added to the overall score. The overall score is then safe from future rolls.Use functions to break apart the code into logical portionsarrow_forwardFour in a row is a game in which players take turns adding tokens to the columns on the game board. Tokens fall to the lowest position in the chosen column that does not already have a token in it. Once one of the players has placed four of their tokens in a straight line (either vertically, horizontally, or diagonally), they win the game If the board is full and no player has won, then the game ends in a draw. TASK Using the following class descriptions, create a UML diagram and a version of Four in a row game The game must allow for a minimum of two and maximum of four players The game must allow each player to enter their name(duplicate names should not be accepted) The game should give the players the ability to choose how many rows (between four and ten), and how many columns (between four and ten) the game board should have. The code uses several classes, including "Player", "Board","Game" and exceptions for handling errors such as invalid moves and full columns.…arrow_forwardDescription: Raghu and Sayan both like to eat (a lot) but since they are also looking after their health, they can only eat a limited amount of calories per day. So when Kuldeep invites them to a party, both Raghu and Sayan decide to play a game. The game is simple, both Raghu and Sayan will eat the dishes served at the party till they are full, and the one who eats maximum number of distinct dishes is the winner. However, both of them can only eat a dishes if they can finish it completely i.e. if Raghu can eat only 50 kCal in a day and has already eaten dishes worth 40 kCal, then he can't eat a dish with calorie value greater than 10 kCal. Given that all the dishes served at the party are infinite in number, (Kuldeep doesn't want any of his friends to miss on any dish) represented by their calorie value(in kCal) and the amount of kCal Raghu and Sayan can eat in a day, your job is to find out who'll win, in case of a tie print "Tie" (quotes for clarity). Input: First line contains…arrow_forward
- When the player clicks on the “Start Game” button, in every 1 seconds, three random alphabets will be generated and flashing on the screen (e.g. A X W) at the position as shown above. The three alphabets must not repeat at the same time (i.e. can’t have repeating alphabets – e.g. A X A). After starting a game, you can’t change the chosen alphabet.arrow_forwardStick or roll is a game involving two players, A and B, and a die with four faces (numbered 1, 2, 3, 4). The faces are equally likely to occur when the die is rolled. Player A rolls the die once and sticks with that number as the score or rolls it again and scores the sum of the two numbers. • If A's score is greater than 4 then A loses. • If A's score is 4 then A wins. If A's score is less than 4, then B rolls the die once and sticks with that number as the score or rolls it again and scores the sum of the two numbers. • If B's score is greater than 4 then B loses. • If B's score is 4 or less and equal to A's or less, then B loses. • If B's score is 4 or less and greater than A's, then B wins. Player B sticks on the first roll if that number wins and rolls again if it doesn't win and it is possible to win with a second roll. Some example games might be: • A rolls a 2, chooses to roll again and rolls a 3. A's score is then 5 so A loses and B wins. * A rolls a 2 and chooses not to roll…arrow_forwardStick or roll is a game involving two players, A and B, and a die with four faces (numbered 1, 2, 3, 4). The faces are equally likely to occur when the die is rolled. Player A rolls the die once and sticks with that number as the score or rolls it again and scores the sum of the two numbers. • If A's score is greater than 4 then A loses. • If A's score is 4 then A wins. If A's score is less than 4, then B rolls the die once and sticks with that number as the score or rolls it again and scores the sum of the two numbers. • If B's score is greater than 4 then B loses. • If B's score is 4 or less and equal to A's or less, then B loses. • If B's score is 4 or less and greater than A's, then B wins. Player B sticks on the first roll if that number wins and rolls again if it doesn't win and it is possible to win with a second roll. Some example games might be: • A rolls a 2, chooses to roll again and rolls a 3. A's score is then 5 so A loses and B wins. * A rolls a 2 and chooses not to roll…arrow_forward
- Create and put into play a Minesweeper game using text. Minesweeper is a well-known single-player computer game in which B mines (or bombs) are dispersed around a NxN grid. All of the other cells are either empty or have numbers in them. The figures represent the number of bombs in the eight adjacent cells. Then the user reveals a cell. A bomb results in defeat for the player.Its number is displayed if it is a number. If the cell is empty, it is revealed together with any nearby empty cells that extend up to and including the numeric cells. When all of the non-bomb cells are disclosed, the player triumphs. The player can also mark specific locations as potentially bomb-prone.This doesn't affect gameplay, other than to block the user from accidentally clicking a cell that is thought to have a bomb.(Tip for the reader: if you're not familiar with this game, please play a few rounds on line first.)arrow_forwardIn c Hangman gameWrite a terminal based on the game of Hangman. In a hangman game, the player is given a wordthat they need to guess, with each letter of the word represented by an underscore/blank. Theplayer tries to guess a letter of the word by entering it into the terminal. If the letter is correct, theblank corresponding to that letter is filled in. If the letter is incorrect, a part of a stick figure isdrawn. The player has a limited number of incorrect guesses before the stick figure is fully drawnand the game is lost. The player wins the game if they guess all the letters of the word before thestick figure is fully drawn.The program should have an array of possible words to choose from. A different word should berandomly chosen from the array every time we run the program.arrow_forwardThere are four medals (Gold, Silver, Bronze and Wood) on a table, but they are all wrapped with dark wrapping paper, such that it is impossible to distinguish them. You would like to find the gold medal. The game starts as follows. You pick one medal without unwrapping it, and then the game host unwraps one of the remaining medals and reveals that it is a silver medal. (Assume here that the host unwraps a medal with equal probability, but knowing where the gold medal was and avoiding unwrapping the gold medal if still on the table, to keep the game interesting to watch until the end.) You have now three medals left to unwrap (one in your hand, two on the table). At this point, the host gives you the option to change your mind and swap your medal for one of the two left on the table. What would you do at this point? Would you keep your medal, or swap it with one of the two medals left on the table? If so, which one? Hints: Find the solution by using Bayes’ theorem,…arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Microsoft Visual C#Computer ScienceISBN:9781337102100Author:Joyce, Farrell.Publisher:Cengage Learning,
EBK JAVA PROGRAMMINGComputer ScienceISBN:9781337671385Author:FARRELLPublisher:CENGAGE LEARNING - CONSIGNMENT
Microsoft Visual C#
Computer Science
ISBN:9781337102100
Author:Joyce, Farrell.
Publisher:Cengage Learning,
EBK JAVA PROGRAMMING
Computer Science
ISBN:9781337671385
Author:FARRELL
Publisher:CENGAGE LEARNING - CONSIGNMENT
Java random numbers; Author: Bro code;https://www.youtube.com/watch?v=VMZLPl16P5c;License: Standard YouTube License, CC-BY