First commit

Author: chimps-ahoy

.gitignore

@@ -0,0 +1 @@
+*~

README.md

@@ -1,2 +1,2 @@
 # GameOfLife
-a little text based game of life simulator i made in about an hour for fun
+a little text based game of life simulator i made in about an hour for fun.

src/GameOfLife.class

@@ -0,0 +1,30 @@
+public class GameOfLife {
+	public static void main(String[] args) throws InterruptedException {
+		Generation curr = null;
+		int generations, rows, cols, time;
+		int[][] glider = { {0,0,0,0,0},
+				   {0,0,1,0,0},
+				   {1,0,1,0,0},
+				   {0,1,1,0,0},
+				   {0,0,0,0,0} };
+		curr = new Generation(glider);
+		generations = 8;
+		time = 1000;
+		try { 
+			generations = Integer.parseInt(args[2]);
+			rows = Integer.parseInt(args[0]);
+			cols = Integer.parseInt(args[1]);
+			curr = new Generation(rows, cols);
+			Generation.setLive(args[3].charAt(0));
+			Generation.setDead(args[4].charAt(0));
+			time = Integer.parseInt(args[5]);
+		} catch (Exception e) {
+			
+		}	
+		for (int i = 0; i < generations; i++) {
+			System.out.println(curr);
+			curr = curr.next();
+			Thread.sleep(time);
+		}
+	}
+}

src/GameOfLife.java

@@ -0,0 +1,84 @@
+public class Generation {
+
+private int[][] grid;
+private int rows;
+private int cols;
+private static char live = '@';
+private static char dead = '*';
+
+	public Generation(int rows, int cols) {
+		grid = new int[rows][cols];
+		for (int i = 0; i < rows; i++) {
+			for (int j = 0; j < cols; j++) {
+				grid[i][j] = (int)(Math.random() * 2);
+			}
+		}
+		this.rows = rows;
+		this.cols = cols;
+	}
+
+	public Generation(int[][] grid) {
+		this.grid = grid;
+		rows = grid.length;
+		cols = grid[0].length;
+	}
+
+	public Generation next() {//generates the next generation
+		int[][] next = new int[rows][cols];
+		for (int i = 0; i < rows; i++) {
+			for (int j = 0; j < cols; j++) {
+				next[i][j] = nextCell(i, j);		
+			}
+		}
+		return new Generation(next);
+	}
+
+	private int nextCell(int x, int y) {//given the coords of a cell, compute what it will become in the next generation
+		int count = 0;
+		for (int dX = -1; dX <= 1; dX++) {//dX and dY are offsets to check neighbors in a 3x3 area around a cell
+			for (int dY = -1; dY <= 1; dY++) {
+				count += (x+dX >= 0 && x+dX < rows && y+dY >= 0 && y+dY < cols) ? (grid[x+dX][y+dY]) : (0);	
+			}
+		}
+		count -= grid[x][y];//doesn't count itself
+
+		int nextCell = grid[x][y];//the next cell starts out as being the current cell and only changes if the rules apply
+		if (grid[x][y] == 0 && count == 3) {
+		       	nextCell = 1;
+	       	} else if (grid[x][y] == 1 && (count < 2 || count > 3)) {
+		       	nextCell = 0;
+	       	}
+
+		return nextCell;
+	}
+
+	public static void setLive(char c) {
+		live = c;
+	}
+
+	public static void setDead(char c) {
+		dead = c;
+	}
+
+	public String toString() {
+		String output = "";
+		for (int i = 0; i < rows; i++) {
+			for (int j = 0; j < cols; j++) {
+				output += (grid[i][j] == 1) ? live : dead;
+				output += '\s';
+			}
+			output += '\n';
+		}
+		return output;
+	}
+
+
+
+
+
+
+
+
+
+
+}