When I feel a bit "down in the dumps" and I don't fancy getting up to do anything, I program. I think it is because it allows me to cut off from the world and focus on one tiny thing. So I have been meaning to look into Conway's Game-of-Life, but never got around to it. The past few days I have been struggling to focus on writing my thesis and ended up writing one in Processing. It's nothing spectacular, but quite fascinating to watch the different patterns grow (or not). Here is my code:
001 int size = 100;
002 int cellsize=4;
003 int displaysize = size * cellsize ;
004 int[][] world = new int[size][size];
005 int[][] newworld = new int[size][size];
006 int r1 = (int)random(size);
007 int c1 = (int)random(size);
008 boolean pause = true;
009 color alive = color(0, 0, 0);
010 color dead = color(255, 255, 255);
011
012
013 void setup() {
014 size(displaysize, displaysize);
015 // initialise world with zeros
016 for (int x = 0; x < size; x++) {
017 for (int y = 0; y < size; y++) {
018 world[x][y] = 0;
019 }
020 }
021
022 // start life
023 // gun
024 world[39][39]=1;
025 world[40][39]=1;
026 world[39][40]=1;
027 world[40][40]=1;
028
029 world[49][39]=1;
030 world[49][40]=1;
031 world[49][41]=1;
032 world[50][38]=1;
033 world[50][42]=1;
034 world[51][37]=1;
035 world[51][43]=1;
036 world[52][37]=1;
037 world[52][43]=1;
038 world[53][40]=1;
039 world[54][38]=1;
040 world[54][42]=1;
041 world[55][39]=1;
042 world[55][40]=1;
043 world[55][41]=1;
044 world[56][40]=1;
045
046 world[59][39]=1;
047 world[59][38]=1;
048 world[59][37]=1;
049 world[60][39]=1;
050 world[60][38]=1;
051 world[60][37]=1;
052
053 world[61][36]=1;
054 world[61][40]=1;
055
056 world[63][35]=1;
057 world[63][40]=1;
058 world[63][36]=1;
059 world[63][41]=1;
060
061 world[73][38]=1;
062 world[73][37]=1;
063 world[74][38]=1;
064 world[74][37]=1;
065
066
067 // oscillator Blinker
068 world[10][10]=1;
069 world[11][10]=1;
070 world[12][10]=1;
071 world[9][11]=1;
072 world[10][11]=1;
073 world[11][11]=1;
074
075 //DieHard
076 world[20][10]=1;
077 world[21][10]=1;
078 world[21][11]=1;
079 world[25][9]=1;
080 world[24][11]=1;
081 world[25][11]=1;
082 world[26][11]=1;
083
084 stroke(dead);
085 }
086
087 void draw() {
088 for (int c = 0; c < size; c++) {
089 for (int r = 0; r < size; r++) {
090 // if there isn't life, make the point white;
091 if (world[c][r]==0) fill(dead);
092 // if there is life make the point black
093 if (world[c][r]==1) fill(alive);
094 //if (world[r][c]==1) System.out.println("life at " + r + "," + c);
095 rect(c*cellsize, r*cellsize, cellsize, cellsize);
096 }
097 }
098 if (!pause) makeworld();
099 }
100
101 void makeworld() {
102
103 // initialise newworld
104 for (int x = 0; x < size; x++) {
105 for (int y = 0; y < size; y++) {
106 newworld[x][y] = world[x][y];
107 }
108 }
109
110 // Determine life in the new world
111 for (int c = 0; c < size; c++) {
112 for (int r = 0; r < size; r++) {
113 // initialise neighbours
114 int neighbours = 0;
115 //check surrounding life
116 for ( int ic = (c-1); ic <= (c+1); ic++) {
117 for ( int ir = (r-1); ir <= (r+1); ir++) {
118 if (((ic>=0)&&(ic<size))&&((ir>=0)&&(ir<size))) {
119 // don't include self
120 if (!(ic == c && ir == r)) {
121 // if there is life increment neighbours
122 if (world[ic][ir]==1) neighbours++;
123 }
124 }
125 }
126 }
127
128 // apply game of life rules
129 // if there is life
130 if (world[c][r] == 1) {
131 if (neighbours < 2 || neighbours > 3) {
132 newworld[c][r] = 0; // Cell dies
133 }
134 // if there isn't life
135 } else {// i.e. world[c][r] == 0
136 if (neighbours == 3) {
137 newworld[c][r] = 1; // Cell becomes alive
138 }
139 }
140 }
141 }
142
143 // initialise newworld
144 for (int x = 0; x < size; x++) {
145 for (int y = 0; y < size; y++) {
146 world[x][y] = newworld[x][y];
147 }
148 }
149 }
150
151
152 void mousePressed() {
153 if (pause) {
154 pause = false;
155 } else {
156 pause = true;
157 System.out.println("pause");
158 }
159
160 }
Java2html
|
|
No comments:
Post a Comment