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. 2. SnakeA logical step forward from interactive animated programs is games. The goal of this assignment is to program the classic computer game, Snake.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 stopmoving, and dies whenever it hits something (excluding apples). Because the snake is growing longer and longer as the game progresses, it gets increasinglydifficult 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 randomlocation, excluding all places covered by the snake. When the snake reaches a side of the game board, it re-emerges at the opposite end.It is probably easiest to understand the game by playing it yourself. You can find a lot of snake implementations on the web, for example here 2. There arefour differences between this implementation and the one you should make. Your implementation should:make the snake should grow block at a time instead of 4.make the snake re-emerge at the other end of the screen when reaching the end of the screen instead of dying.make the snake start at a length of 2, at the top left (instead of a length of 1 at the center).Take the following steps to implement the game:1. First make a single cell that keeps moving, and of which you can change the direction via the arrow keys.2. Change the program such that if the cell goes beyond the end of the screen, it reemerges at the other end. For example, if the cell leaves the screen onthe right side, it should come out on the left side.3. Make a snake of length 2 that starts in the top left, and then only grows (as if it eats an apple each step). Keep a list of points in the snake and add a newpoint to the end after each step.4. Make a snake that moves and stays of length 2. It moves by adding an extra step to your program: after adding a new point to the end of the list,remove a point at the start of the list.5. Place the apple using ui.random as described below (at this point you should be able to pass some tests).6. Allow the snake to eat apples. Do the following steps (afterward you should pass some more tests):o If the head of the snake is on the apple:1. Do not remove a point at the start of the list (this makes the snake grow by 1 cell)2. Place a new apple as described above7. Implement game over. If the point where the head of the snake is is also in the body (snake without head), then the game is over. Callui.set_game_over() to display the game over screen. Afterward, you should be able to pass all tests. Apple placementTo ensure reproducible behavior, we specify exactly how a random number generator must be used to place the food. For this, we provide the methodui.random(max)This gives a random integer in the range [0 - max ) (exclusive). During testing, the result of this method will not be random, but will be the number specifiedas apple_spot in the test files.You might be tempted to randomly place the apple using the following method, which we DO NOT USE:1. Pick a random horizontal coordinate.2. Pick a random vertical coordinate.3. If the resulting coordinate is not free, try again.Thishod has the downside that it might take a lot of tries before you find aspot, especiallyis almfull. Moreover, it requires anarbitrary amount of numbers for placing a single apple, which complicates testing.Instead of the above method, we opt for a method that always succeeds at placing an apple, using only a single number. To see how this works, suppose wehave a 5x3 board and the current position of the snake is as follows:.XXX.To determine the position of the apple, we want to pick a random free spot on the board (the apple should not be placed on the snake). We number thefree spots on the board from left to right, top to bottom, skipping any spot occupied by the snake. In our example, this means the following numbering:0 | 1 | 2 1 3 | 45 I XI XI X 67 | 8 | 9 1 101 11To pick a random spot, first compute the number of free spots and then call ui.random(nrFreeSpots) (in our case nrFreeSpots=12). Then place the apple atthe position corresponding to the number you got.Game overThe game ends when the head of the snake collides with the rest of the body. In that event, you should call ui.set_game_over() to display the game overscreen.

Program Plan: Create a game screen and set the caption. Define scoreBoard() method to display the…

Answered: he goal of Snake is to create a snake…

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...