Concept explainers
Computer Science
Godot
Programming Problem 1. Rock, Paper, Scissors This is your traditional rock-paper-scissors game, where two players select one of the three options and a result is produced based on their selection. For reference: Rock beats scissors Paper beats rock Scissors beats paper For this problem, you are to assume that two human players will play against each other and will input their choices accordingly. The input for each player will be in the form of buttons. Once a player clicks on a button, the rest of their buttons are locked in place (i.e. disabled). Once the other player selects their pick, the program outputs who won or if there was a draw. This isn’t exactly the most realistic way to code the game as it would be better if both players made their choice at the same time, but we’ll just have to chalk this up as a limitation for our exam. Aside from the game itself, the program should track the score of each player. Basically, if one wins, that player’s score goes up by one. When a draw occurs, neither players’ score increments.
Trending nowThis is a popular solution!
Step by stepSolved in 2 steps with 1 images
- 8. Write a program: a menu-driven automatic teller program in which the user's bank balance is initialized to 2000 USD. The user should be allowed to perform as many transactions as he or she wishes from the menu. 1. Deposit 2. Withdrawal 3.See Balance 4.Exit For the withdrawal option, the user should be prompted to select from the choices $50, S100, S200, and S500 (do not allow the user to over draw). After each transaction, the program should print the current balance.arrow_forwardHappy Numbers Programming challenge description: A happy number is defined by the following process. Starting with any positive integer, replace the number by the sum of the squares of its digits, and repeat the process until the number equals 1 (where it will stay), or it loops endlessly in a cycle which does not include 1. Those numbers for which this process ends in 1 are happy numbers, while those that do not end in 1 are unhappy numbers. Input: Your program should read lines of text from standard input. Each line contains a single positive integer, N. Output: If the number is a happy number, print 1 to standard output. Otherwise, print 0. 1 process.stdin.resume(); 2 process.stdin.setEncoding('utf8'); 3 4 let stdin = ''; 5 process.stdin.on('data', (chunk) => { stdin = '$(stdin)${chunk}"; 7)).on('end', () => { 6 9 8 const lines = stdin.trim().split('\n'); for (const line of lines) { process.stdout.write('$(line)\n'); 10 11 } 12 }); 13 H > Test Case Output & G earrow_forwardProgramming Language: C++ Develop a Tic Tac Toe game that will match a player against the computer. Do’s: Use a typical 3 x 3 board. The horizontal axis should be labeled A, B, C. The vertical axis should be labeled 1, 2, 3. For Example: the attatched picture. Use User-Defined Functions. Use Branching. Use Loops. Use String functions. Randomly determine who will move first, the human or computer. Assign O to the computer and X to the Human player. Ask the user to select their move using the horizontal and vertical position. For example: A1 for the upper left square, or B2 for the center square. After each move, redraw the board with the X’s and O’s in the right positions. After each game, ask the user if they want to play again. If they do, start the game again. Do not’s: Don’t use User Classes or Objects Don’t use imagesarrow_forward
- Card guessing Design a strategy that minimizes the expected number of questions asked in the following game You have a deck of cards that consists of one ace of spades, two deuces of spades, three threes, and on up to nine nines, making 45 cards in all. Someone draws a card from the shuffled deck, which you have to identify by asking questions answerable with yes or no.arrow_forwardDesign the worst calculator ever: an application that accepts two numbers from the user and, when a button is pushed, performs a single operation and displays the results. You may choose: Multiplication, Division, Subtraction, square root, or raising the first number to the exponent of the second number. Don't use addition as we already did that in class. The result must be displayed to the user only when an appropriately labeled button is pushed.arrow_forwardPYTHON programming solotion Develop a program that allows the user to enter a start value of 1 to 4, a stop value of 5 to 12 and a multiplier of 2 to 8. The program must display a multiplication table with results using these values. For example, if the user enters a start value of 3, a stop value of 7 and a multiplier value of 3, the table should be displayed as follows: Multiplication Table 3 x 3 = 9 3 x 4 = 12 3 x 5 = 15 3 x 6 = 18 3 x 7 = 21 additionally Each multiplication problem must be displayed with a problem number. The program must prompt the user to enter an answer to each of the multiplication problems. The correct answer should be displayed after the user enters an answer. A message should be displayed informing the user that the answer entered was correct or incorrect followed by an appropriate motivating comment. A running record of the number of correct and incorrect responses must be kept. After all the problems have been presented the user must be informed of…arrow_forward
- Java problem First-Player Advantage Pig is a folk jeopardy dice game with simple rules: Two players race to reach 100 points. Each turn, a player repeatedly rolls a die until either a 1 ("pig") is rolled or the player holds and scores the sum of the rolls (i.e. the turn total). At any time during a player's turn, the player is faced with two decisions: roll - If the player rolls a 1: the player scores nothing and it becomes the opponent's turn. 2 - 6: the number is added to the player's turn total and the player's turn continues. hold - The turn total is added to the player's score and it becomes the opponent's turn. Problem: There is an advantage to going first in Pig, but how big an advantage is it for “hold at 20 or goal” play? We wish to estimate the probability of a first-player win with a hold-at-20-or-goal play policy. Simulate a given number of two-player Pig games where a player rolls until a 1 ("pig") is rolled, or the turn total is greater than or equal to 20, or the…arrow_forwardPart 3: Looping while(x<y) { If(z<0){ x=x+a; } Else{ x=x+z; z= -z } x=x+1; } Instructor Example 1: user input: x=5, y=2, z=5, a=5 x y z a Instructor Example 2: user input: x=2, y=13, z= -1, a=4 x y z a Looping Test Case 1: user input: x=2, y=18, z=10, a=2 x y z a Looping Test Case 2: user input: x=1, y=6, z=0, a=10 x y z aarrow_forwardMicrofost Visual C# 7th edition programming exercise 6-10. I need help, please. This problem relies on the generation of a random number. You can create a random number that is at least min but less than max using the following statements: Random ranNumberGenerator = new Random();int randomNumber;randomNumber = ranNumberGenerator.Next(min, max); Create a game similar to Hangman named GuessAWord in which a player guesses letters to try to replicate a hidden word. Store at least eight words in an array, and randomly select one to be the hidden word. Initially, display the hidden word using asterisks to represent each letter. Allow the user to guess letters to replace the asterisks in the hidden word until the user completes the entire word. If the user guesses a letter that is not in the hidden word, display an appropriate message. If the user guesses a letter that appears multiple times in the hidden word, make sure that each correct letter is placed. Figure 6-27 shows a typical game…arrow_forward
- 8. A game is played by moving a game piece left or right along a horizontal game board. The board consists of spaces of various colors, as shown. The circle represents the initial location of the game piece. Yellow Black Green Green Red Yellow Black Black Yellow Black The following algorithm indicates how the game is played. The game continues until the game is either won by landing on the red space or lost when the piece moves off either end of the board. Step 1: Place a game piece on a space that is not red and set a counter to 0. Step 2: If the game piece is on a yellow space, move the game piece 3 positions to the left and go to step 3. Otherwise, if the game piece is on a black space, move the game piece 1 position to the left and go to step 3. Otherwise, if the game piece is on a green space, move the game piece 2 positions to the right and go to step 3. Step 3: Increase the value of the counter by 1. Step 4: If game piece is on the red space or moved off the end of the game…arrow_forwardQ1In manual car gear system, pressing down the clutch pedal allows the driver to change the car’s gears to drive the vehicle on the road with different speed. Following are the dummy details about gear number and their relevant speed limit. 1st Gear 0 – 10 mile per hour (mph) 2nd Gear 10 – 20 mile per hour (mph) 3rd Gear 20 – 60 mile per hour (mph) 4th Gear 60 – 100 mile per hour (mph) Suppose an expert driver is going from Haji Camp Peshawar to Sarhad University Peshawar using the following route drawn as Yellow line with three roundabouts (Red Circles). In manual car gear system, pressing down the clutch pedal allows the driver to change the car’s gears to drive the vehicle on the road with different speed. Following are the dummy details about gear number and their relevant speed limit. 1st Gear 0 – 10 mile per hour (mph) 2nd Gear 10 – 20 mile per hour (mph) 3rd Gear 20 – 60 mile per hour (mph) 4th Gear 60 – 100 mile per hour (mph) Suppose an expert driver is going…arrow_forwardHangman 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.Others: Do not use GOTO statementsarrow_forward
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education