5. Hangman The Goal: Despite the name, the actual “hangman" part isn't necessary. The main goal here is to create a sort of “guess the word" game. The user needs to be able to input letter guesses. A limit should also be set on how many guesses they can use. This means you'll need a way to grab a word to use for guessing. (This can be grabbed from a pre-made list. No need to get too fancy.) You will also need functions to check if the user has actually inputted a single letter, to check if the inputted letter is in the hidden word (and if it is, how many times it appears), to print letters, and a counter variable to limit guesses.

5. Hangman The Goal: Despite the name, the actual “hangman" part isn't necessary. The main goal here is to create a sort of “guess the word" game. The user needs to be able to input letter guesses. A limit should also be set on how many guesses they can use. This means you'll need a way to grab a word to use for guessing. (This can be grabbed from a pre-made list. No need to get too fancy.) You will also need functions to check if the user has actually inputted a single letter, to check if the inputted letter is in the hidden word (and if it is, how many times it appears), to print letters, and a counter variable to limit guesses.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

AGU Computer Engineering Department created a new mathematical game that can be played with two people. In this game, you are given a list of random integers. At each round, the first player takes two numbers from the list and calculates the sum of these numbers. Then, the second player takes two numbers and makes the same calculation. The higher one is going to take the round and increment the score by 1. At the end of the game, who has the better score will win the game. Here are the rules for the game: There are always an even number of items on the list There are two colors for the players: Green and Red Green starts the game At each round, green plays and then red plays The player takes the first and the last numbers The game can end Tie when the scores are the same. The game will end when there is no element to take from the list Your program on java will simulate the rounds and find out the winner, Green or Red or Tie. The input will be two lines. Input…
canMove(int x, int y, int destX, int destY, Side s): This method returns true if the player of color s can move the piece at coordinates (x,y) can move to coordinates (destX, destY) on the board in its current state. This means that here you do need to consider this piece’s interaction with other pieces on the board. Conditions for this method to return false are given in the code. public boolean canMove(int x, int y, int destX, int destY, Side s){ /* TODO write a method that checks if a piece at coordinates x,y can move to coordinates destX,destY Conditions for false: - Origin or destination coordinates are outside the board - Piece at origin is null - If source and destination coordinates are the same - Piece at origin is not of the same side as s - You can check this using piece.getSide() - Piece cannot move to the destination by piece movement rules - You should check this using Piece.canMove(destX,…
Nim 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…
You 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…
Correct answer will be upvoted else downvoted. You are playing the game "Orchestrating The Sheep". The objective of this game is to make the sheep line up. The level in the game is depicted by a line of length n, comprising of the characters '.' (void space) and '*' (sheep). In one action, you can move any sheep one square to the left or one square to the right, if the relating square exists and is vacant. The game finishes when the sheep are arranged, that is, there ought to be no vacant cells between any sheep. For instance, assuming n=6 and the level is depicted by the string "**.*..", the accompanying game situation is conceivable: the sheep at the 4 position moves to one side, the condition of the level: "**..*."; the sheep at the 2 position moves to one side, the condition of the level: "*.*.*."; the sheep at the 1 position moves to one side, the condition of the level: ".**.*."; the sheep at the 3 position moves to one side, the condition of the level: ".*.**.";…
THIS MUST BE DONE IN CORAL: Cracked Egg Game: There are a dozen eggs in a basket; some are hard boiled and some are raw. The object of this game is for the user to guess the number of hard-boiled eggs prior to playing the game. The computer then simulates cracking all 12 eggs, using a random number 0 or 1 to simulate raw or hard boiled. The number 0 should represent raw eggs and the number 1 should represent hard boiled. The computer must keep track of the number of hard-boiled eggs. At the conclusion of cracking all 12 eggs, the actual number of hard boiled is compared to the user’s guess, and whether the user won or lost is given as output. The goal of this milestone is to use Coral to program one of the loops you will need for your finalized program in Project Two. This will help you define the logic, flow, and sequence of the game. For this work, you will write code in Coral for your selected programming game by accessing the activity in the zyBook. Note that links for each are…
Description: The game is a single player scenario, in which the player’s army needs to defeat the enemy’s (AI’s) army. There are 4 possible troops for an army: Archers, Spearman, Cavaliers, Footman. Each troop has some attributes and some actions. And to avoid excessive programming and calculation, we want to treat these troops as squadrons. The player always starts with 10 squadrons of their choices: they can choose any combinations of the 4 possible troop types. Each squadron should have 100 members of that troop type. Each turn, the player is allowed to choose one of their squadrons and perform an action which is allowed by that troop type. Player and the AI take turns to make actions. The game continues until either the player or the AI has no troops left. Troop Types and Descriptions: Archers: should be able to attack from range with no casualties, meaning the attack action should not cause any damage to themselves. They should be pretty fragile to anything themselves. They…
Make a MAZE game on Spyder, giving the user to choose their route. Each route will have either doors or obstacles that the user will solve or use logic to complete. Use a random function so the obstacles change with a new try. The user needs to get out of the Maze in three tries or he loses a life. The user will be asked a question whether they want to try it again or skip the level. Need help with the code!! Thank you
Flexibility exercises stretch your muscles and can help your body stay flexible. These exercises may not improve your endurance or strength, but being flexible gives you more freedom of movement for other exercise as well as for your everyday activities. Flexibility is a Fitness and we cannot give the actual implementation for the methods muscleTargeted () and calorieLoss () as we don't know the actual Anaerobic exercise. The descripton () method returns the string Flexibility is uncomfortable and it takes time, so people don't like to do it. Note that Flexibility is a good candidate to be abstract class. Define classes Yoga and TaiChi, which are Flexibility fitness exercises. Use the table above to define the classes. The classes also have: • @0verride public String description () returns the name of the respective classes.
Add the code to the end of your monitorLevels() method. It must become the last code of monitorLevels(). Study the comments and complete the code # Loop through displayList for i in range(0,len(displayList)): # Test if the first item in the current sub-list contains the text "Price Level" # Tip: Remember that each sub-list is a list within a list (displayList). So you have # to access its items via displayList followed by TWO indexes. . . . # Extract the second item from the current sub-list into a variable called priceLevel priceLevel = . . . # Test if priceLevel is between previousPrice and currentPrice OR # priceLevel == previousPrice OR # priceLevel == currentPrice if( . . . ): # Sound the alarm. Pass in the frequency and duration.…
AVA code OVERVI EW This is a review exercise, so the primary goal of the exercise is to get your mind working and in the correct space.In this activity you will create a imaginary grid of locations that goes from −?≤?≤?, −?≤?≤?, with the coordinate (0,0) being "home". On this grid you will keep track of various animal objects as they move around the grid. Make sure that all animals stay within that grid at all timesincluding when they are created. Zwill be the map size and will control the highest number allowed on themap before wraping around. Using Java, create the following classes and primary program that uses the classes that you developed. INS T RUCT IONS Create the following classes. A N I MA L C LA SS Create an Animal class. Each animal has a name, an x and y integer coordinate. The Animal class should have at minimum the following methodsbelowbut you may want to add more if necessary: Also note, everyanimal will need to have to have “z”passed to it so that it knows how big the…
Email me the answers to the following questions. If you are not familiar with Peg Solitaire, then look it up online. Peg Solitaire is a game consisting of a playing board with 33 holes together with 32 pegs. In the picture above, the hole in the center is empty and the remaining holes contain pegs. The goal is to remove all the pieces except one, which should be in the center. A piece can be removed by jumping an adjacent piece over it into an empty hole. Jumps are permitted horizontally or vertically, but not diagonally. Your assignment consists of one required part, plus one extra credit part: 1. Explain (in words) why Breadth First Search and Iterative Deepening are not good methods for this problem.