Source Code
<![CDATA[
import javax.swing.JFrame;
import java.awt.Color;
import java.awt.image.BufferedImage;
import java.awt.Graphics2D;
import java.awt.Toolkit;
import java.awt.Point;
public class GameOfLife extends JFrame {
private final Graphics2D g;
private final BufferedImage frame;
private final int cx = Toolkit.getDefaultToolkit().getScreenSize().width, cy = Toolkit.getDefaultToolkit().getScreenSize().height;
public static void main(String[] args) {
new GameOfLife();
}
public GameOfLife() {
setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);
setExtendedState(JFrame.MAXIMIZED_BOTH);
setUndecorated(true);
getContentPane().setBackground(Color.BLACK);
getContentPane().setCursor(Toolkit.getDefaultToolkit().createCustomCursor(new BufferedImage(16, 16, BufferedImage.TYPE_INT_ARGB), new Point(0, 0), ""));
setVisible(true);
frame = new BufferedImage(cx, cy, BufferedImage.TYPE_INT_RGB); // TYPE_3BYTE_BGR is slow
g = (Graphics2D)frame.getGraphics();
g.setColor(Color.WHITE);
run();
}
public void run() {
double st;
final int res = 3; // resolution (must be >1)
final boolean[][] m = new boolean[cx/res][cy/res];
final boolean[][] c = new boolean[cx/res][cy/res];
int n;
random(m);
while(true) {
st = time();
for(int y=0; y < m[0].length; y++) {
for(int x=0; x < m.length; x++) {
n = count(m,x,y); // ---------- rules ----------
if(m[x][y]==false && n==3) c[x][y] = true;
else if(m[x][y]==true && n<2) c[x][y] = false; // n<0 for crystal growth
else if(m[x][y]==true && n>3) c[x][y] = false;
else if(m[x][y]==true) c[x][y] = true;
}
}
for(int y=0; y < m[0].length; y++) {
for(int x=0; x < m.length; x++) {
m[x][y] = c[x][y]; // update field
if(m[x][y]) g.fillRect(x*res, y*res, res-1, res-1); // draw field
}
}
this.getGraphics().drawImage(frame, 0, 0, null);
g.clearRect(0, 0, cx, cy);
pause(1.0/60.0-time()+st);
}
}
public int count(boolean[][] m, int x, int y) {
int n=0, a=x-1, b=x+1, c=y-1, d=y+1;
if(x == 0) a = m.length-1; // toroidal field
else if(x == m.length-1) b = 0;
if(y == 0) c = m[0].length-1;
else if(y == m[0].length-1) d = 0;
if(m[a][c]) n++; // neighbour count
if(m[a][y]) n++;
if(m[a][d]) n++;
if(m[x][c]) n++;
if(m[x][d]) n++;
if(m[b][c]) n++;
if(m[b][y]) n++;
if(m[b][d]) n++;
return n;
}
public void random(boolean[][] m) {
for(int y=0; y < m[0].length; y++) for(int x=0; x < m.length; x++) m[x][y] = Math.random() < 0.3125;
}
public double time() {
return System.nanoTime()*1E-9;
}
public void pause(double s) {
if(s > 0) {
try {
Thread.sleep((int)(s*1E3));
} catch(Exception e) {}
}
}
}]]>
