Write a program that allows the user to input the r- and y-coordinates of two squares, and then prints out whether or not they form a valid ship – meaning that both squares lie on the grid, and are adjacent to one another horizontally or vertically. If one of those conditions is not met, the program should print out a message saying which condition is wrong. (If both conditions are not met, the program only needs to output a single message, which can be either one, your choice.) For example, here is a sample run: Enter x-coordinate of square one: 3 Enter y-coordinate of square one: 2 Enter x-coordinate of square two: 3 Enter y-coordinate of square two: 3 Valid - here, the numbers are input by the user, and everything else is produced by the program; this is Valid because it corresponds to the first placement shown in the figure above. Other sample runs might look like: Enter x-coordinate of square one: 3 Enter y-coordinate of square one: -1 Enter x-coordinate of square two: 5 Enter y-coordinate of square two: 2 Square(s) not on grid

Write a program that allows the user to input the r- and y-coordinates of two squares, and then prints out whether or not they form a valid ship – meaning that both squares lie on the grid, and are adjacent to one another horizontally or vertically. If one of those conditions is not met, the program should print out a message saying which condition is wrong. (If both conditions are not met, the program only needs to output a single message, which can be either one, your choice.) For example, here is a sample run: Enter x-coordinate of square one: 3 Enter y-coordinate of square one: 2 Enter x-coordinate of square two: 3 Enter y-coordinate of square two: 3 Valid - here, the numbers are input by the user, and everything else is produced by the program; this is Valid because it corresponds to the first placement shown in the figure above. Other sample runs might look like: Enter x-coordinate of square one: 3 Enter y-coordinate of square one: -1 Enter x-coordinate of square two: 5 Enter y-coordinate of square two: 2 Square(s) not on grid

EBK JAVA PROGRAMMING

9th Edition

ISBN:9781337671385

Author:FARRELL

Publisher:FARRELL

Chapter9: Advanced Array Concepts

Section: Chapter Questions

Problem 2GZ

See similar textbooks

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 character, r, p, or s, each representing one of the three choices. Then, determine the winner. Save the application as RockPaperScissors.cs.
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…
Humans vs Goblin with objects: Land/goblins/humans. game uses a grid and has a turn based move of north, south, east, west. Com
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.
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. Save the application as RockPaperScissors.java
. The game consists of a 7x7 board of which 10 of those 49 slots are “stars”. Theobjective of the game is to determine the position of these stars. To help withidentifying the correct position, some slots contain hints in the form of numbers.These hints work like the number hints in minesweeper in the sense that itidentifies how many stars are adjacent to the slot. The range of values are from0 (no stars) to 8 (fully surrounded by stars). A Tentaizu puzzle contains only thesenumber hints. Much like other puzzle games like sudoku, there is only onecombination of star positions that is described by the puzzle.2. Your task is to create a solver function for a given Tentaizu puzzle. This functionshould be able to recursively solve the puzzle. Define a function “solve” with theinput variable being a 7x7 list representing the Tentaizu puzzle. The return valueshould be a list of tuples containing the correct coordinates of the 10 stars. Ifthere is no valid solution, it should return an empty…
The game is played in the magic maze, as shown below. The squares are flaming lava pools. If you try to cross them you will die. The grid lines are passageways and are safe to travel in. You can start at any location on the grid but must travel in the passageways. You may travel as far as you want in any direction, but once you turn, you must repeat that distance and you may only make left turns. You may not reverse direction inside the tight passageways. You must end up at the same spot you started at. If you successful, then you gain a magic coin, which automatically appears. You can start over again and again in a different or same starting spot and earn new magic coins, but the routes you take must differ somehow for each magic coin. That is, no magic coins for the exact same route as previously done. If the route varies in any way (perhaps it is the same starting location and ending location as a previous route, but longer), it will earn a new magic coin. Mad Madame Mim has…
#The game Mancala is one of the oldest games in recorded #history. You can read more about it here: #https://www.thesprucecrafts.com/how-to-play-mancala-409424 # #For this problem, though, you don't need to know how to #play the game. All you need to know is the board layout #and the conditions for winning. # #A Mancala board is made of two rows of 6 cups, with two #bigger cups at the ends. Each cup holds some number of #stones or chips. For our purposes, though, we'll include #the bigger cups at the end of the corresponding rows. # #So, for us, a Mancala board is represented as a #2-dimensional list of integers. Each item in the lists #represents a cup, and the number represents how many #stones are currently in that cup. For example, this #could be one board: # # [[5, 3, 0, 2, 6, 8, 1], # [1, 6, 8, 0, 4, 1, 4]] # #With this board representation, the game is over when #every cup is empty except the top left and the bottom #right. When the game is over, whoever has more stones #in…
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…
1. Tentaizu is a classic Japanese game that translates to “celestial map” or “starchart.” These bare some similarities to minesweeper; however, it is quite farfrom it.2. The game consists of a 7x7 board of which 10 of those 49 slots are “stars”. Theobjective of the game is to determine the position of these stars. To help withidentifying the correct position, some slots contain hints in the form of numbers.These hints work like the number hints in minesweeper in the sense that itidentifies how many stars are adjacent to the slot. The range of values are from0 (no stars) to 8 (fully surrounded by stars). A Tentaizu puzzle contains only thesenumber hints. Much like other puzzle games like sudoku, there is only onecombination of star positions that is described by the puzzle.3. Your task is to create a solver function for a given Tentaizu puzzle. This functionshould be able to recursively solve the puzzle. Define a function “solve” with theinput variable being a 7x7 list representing the…
The Penny Pitch game is popular in amusement parks. Pennies are tossed onto aboard that has certain areas marked with different prizes. For example: The prizes available on this board are puzzle, game, ball, poster, and doll. At the end ofthe game, if all of the squares that say BALL are covered by a penny, the player gets theball. This is also true for the other prizes. The board is made up of 25 squares (5 x 5).Each prize appears on three randomly chosen squares so that 15 squares contain prizes.Create a penny_pitch application that displays a Penny Pitch board (use [ and ] toindicate squares) with prizes randomly placed and then simulates ten pennies being randomly pitched onto the board. After the pennies have been pitched, the applicationshould display a message indicating which prizes have been won, it any.
The goal of Snake is to create a snake as long as possible. This is achieved by guiding the snake to an apple on the game board. The snake cannot stop moving, and dies whenever it hits something (excluding apples). Because the snake is growing longer and longer as the game progresses, it gets increasingly difficult to avoid collisions with the snake itself. The player can change the direction of the head of the snake by using the arrow keys. At step in the game, there is always an apple somewhere on the board. If the snake eats an apple, the snake becomes one cell longer. A new apple is placed on a random location, excluding all places covered by the snake. When the snake reaches a side of the game board, it re-emerges at the opposite end.