To be truthful, this is an assignment for my class that has just ended. I turned it in thinking that I had finished it. I was suppose to do the three methods at the bottom of the code and I did and I believe its correct but my professor gave me my grade saying that it didnt compile and I dont know why. Can someone help?
import java.util.Scanner; import java.util.Random; public class user_Life { // the size of the grid (GRIDSIZE x GRIDSIZE) final private static int GRIDSIZE = 18; /********************************************************************************/ public static void main ( String args[] ) { boolean[][] board = new boolean[GRIDSIZE][GRIDSIZE]; char choice; int x = 1; Scanner sc = new Scanner ( System.in ); do { System.out.print ( "Start with a (r)andom board, the (q)ueen bee shuttle or the (g)lider pattern? "); choice = sc.next().charAt(0); } while ( choice != 'r' && choice != 'q' && choice != 'g' ); clearGrid (board); setup(board,choice); do { System.out.printf ("Viewing generation #%d:\n\n", x++); displayGrid(board); genNextGrid(board); System.out.print ("\n(q)uit or any other key + ENTER to continue: "); choice = sc.next().charAt(0); } while ( choice != 'q' ); } /********************************************************************************/ public static void setup (boolean[][] board, char which ) { Random randomNumbers = new Random(); clearGrid(board); if ( which == 'q' ) { // Set up the Queen Bee Shuttle pattern board[5][1] = true;board[5][2] = true;board[6][3] = true;board[7][4] = true; board[8][4] = true;board[9][4] = true;board[10][3] = true;board[11][2] = true; board[11][1] = true; } else if ( which == 'g' ) { // Set up a Glider board [17][0] = true; board[16][1] = true; board[15][1] = true; board[16][2] = true; board [17][2] = true; } else { // set up random for (int row = 0; row < board.length; row++ ) { for (int col = 0; col < board[row].length; col++ ) { if ( randomNumbers.nextInt() % 2 == 0 ) board[row][col] = true; } } } } /********************************************************************************/ public static void displayGrid (boolean[][] grid) { // Start printing the top row of numbers System.out.print (" "); for (int x = 1; x <= grid.length; x++) { if ((x / 10) != 0) System.out.printf ( "%d", x / 10 ); else System.out.print ( " " ); } System.out.println(); System.out.print( " " ); for (int x = 1; x <= grid.length; x++) { System.out.printf ( "%d", x % 10 ); } System.out.println(); for (int r = 0; r < grid.length; r++) { System.out.printf ( "%d", r+1 ); if (r + 1 < 10) System.out.print ( " " ); else System.out.print ( " " ); for (int c = 0; c < grid.length; c++) { if (grid[r][c] == true) System.out.print ( "*" ); else System.out.print ( " " ); } System.out.println(); } } /*******************************************************************************/ // put the three methods you must write here and make sure to document // them! public static void clearGrid ( boolean[][] board ) { int col=0; for (int row = 0; row <=18; row++) { while(col<18) { board [row][col] = false ; col++; } } } public static void genNextGrid ( boolean[][] board ) { boolean[][] temp = new boolean[GRIDSIZE][GRIDSIZE]; for (int row=0; row<GRIDSIZE; row++)//start of row { for (int col=0; col<GRIDSIZE; col++) { temp[row][col]=board[row][col]; int count = countNeighbors ( temp , row, col ); switch (count) {//start of count switch case 0: case 1: temp[row][col]=false; break; case 2: if(temp[row][col]) temp[row][col]=true; if(!temp[row][col]) temp[row][col]=false; break; case 3: temp[row][col]=true; break; case 4: case 5: case 6: case 7: case 8: temp[row][col]=false; break; }//end of switch statement board [row][col]=temp[row][col]; displayGrid(board); }//end of for row } } public static int countNeighbors ( final boolean[][] board, final int row, final int col ) { int ncount = 0; for(int r = row-1; r <= row+1; r++) { if(row < 0 || row >= GRIDSIZE ) { continue; } for(int c = col - 1; c <= col + 1; c++) { if(col < 0 || col >= GRIDSIZE || (r == row && c == col)) { continue; } if(board[row][col]) { ncount++; } } } return ncount; } } }