need help Problem 2-Name your class Totally NotPacman You are develo ping a new

Question

need help

Problem 2-Name your class Totally NotPacman You are develo ping a new game similar to the arcade angular grid of character mustade classic Pacman. Each level in the game consists of a e avoiding various enemies. Each level will be stored as a Each e certain intg various enemies. Each level wit egers represent certain components: 0 Open space Wall Enemy Main character An example level is shown below: Columns 0 2 0 0 0 0 0 0 are occupied by an enemy. For example, in the data above, there are 19 non-wall cells. Of those enemy. Thus, the difficulty would be 3/19 or about 0.158. 1. (6 pts) Let's define the "difficulty" of a level as the proportion of non-wall cells that 19, 3 are occupied by an Write a method difficulty that takes a 2D array in the above format as a parameter. The method should return the difficulty of that level. 2. (10 pts) Let's say that the main character is considered "under threat" if there are at least two enemies within the eight cells immediately surrounding the main character (all four cardinal directions, and all four diagonal directions). For example, in the level above the main character is not under threat since there are no enemies in the immediately surrounding cells. Note that there may be fewer than eight surrounding cells if the main character is on the edge of the level. Write a method isUnder Threat that takes a 2D array in the above format as a parameter. The method assume that the main character shows up exactly once in the 2D array. Be careful not to go beyond the should return whether the main character is under threat according to the definition above. You may bounds of the array! (4 pts) Write a main method that creates a 2D array with the data from the example above, then calls both of your methods and shows the results. You do not need to read any user input.

Explanation / Answer

since the language is not mentioned. I have added in java

/* package whatever; // don't place package name! */

import java.util.*;

import java.lang.*;

import java.io.*;

class Maze

{

public static double difficult(int[][] maze,int r,int c){

int count0=0,count2=0;

for(int i=0;i<r;i++){

for(int j=0;j<c;j++){

if(maze[i][j]==2){

count2++;

}

if(maze[i][j]==0||maze[i][j]==3){

count0++;

}

}

}

return (double)count2/(count0+count2);

}

public static boolean isUnderThreat(int[][] maze,int r,int c){

boolean foundMain=false;

int i,j=0;

//find the position of main

for( i=0;i<r;i++){

for( j=0;j<c;j++){

if(maze[i][j]==3){

foundMain=true;

break;

}

}

if(foundMain)

break;

}

if(!foundMain)

return false;

int rowmain=i;

int colmain=j;

int enemies=0;

// crawl for 8 cells in all directions

for( i=rowmain-8;i<rowmain;i++){

if(i<0)

continue;

if(maze[i][colmain]==2)

enemies++;

}

for( i=colmain-8;i<colmain;i++){

if(i<0)

continue;

if(maze[rowmain][i]==2)

enemies++;

if(enemies>=2)

return true;

}

for( i=rowmain+1;i<rowmain+8;i++){

if(i>=r)

break;

if(maze[i][colmain]==2)

enemies++;

if(enemies>=2)

return true;

}

for( i=colmain+1;i<colmain+8;i++){

if(i>=c)

break;

if(maze[rowmain][i]==2)

enemies++;

if(enemies>=2)

return true;

}

if(enemies>=2)

return true;

else

return false;

}

public static void main (String[] args) throws java.lang.Exception

{

int[][] maze={{1,1,2,1,0,1,1},{1,1,0,2,0,1,1},{1,0,0,1,1,1,1},{1,0,1,0,0,0,1},{1,0,1,0,1,0,1},{0,3,0,2,1,0,1}};

System.out.println(difficult(maze,6,7));

System.out.println(isUnderThreat(maze,6,7));

}

}

Related Questions

Navigate

• Browse (All)
• Browse N
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.