schmidtfe80398/GameOfLifeAssignment
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Solution

Browse Source
This commit is contained in:
Felix Schmidt 2021-12-22 21:52:04 +01:00
parent 09a995eccf
commit 44daedac13
3 changed files with 153 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

1
src/ILife.java
View File

@ -11,4 +11,5 @@ public interface ILife {
// Methoden zum Fortschreiben der Generationen
public ILife nextGeneration();
}

121
src/Life.java
View File

@ -1,18 +1,20 @@
import java.util.Arrays;
public class Life implements ILife {
String[] lifeArray;
public static void main(String[] args) {
Life l = new Life(new String[] { " ",
" ",
" *** ",
Life l = new Life(new String[] { "* ",
"* ",
"* ",
" ",
" " });
l = (Life) l.nextGeneration();
}
public Life() {
nukeAll();
}
public Life() { nukeAll(); }
public Life(String[] setup) {
this();
@ -26,30 +28,133 @@ public class Life implements ILife {
@Override
public void nukeAll() {
// TODO Auto-generated method stub
lifeArray = new String[] { " ",
" ",
" ",
" ",
" "};
}
@Override
public void setAlive(int x, int y) {
// TODO Auto-generated method stub
String newString = "";
for(int i = 0; i < lifeArray[y].length(); i++) {
if(i == x) {
newString += '*';
} else {
newString += lifeArray[y].charAt(i);
}
}
lifeArray[y] = newString;
}
@Override
public void setDead(int x, int y) {
// TODO Auto-generated method stub
String newString = "";
for(int i = 0; i < lifeArray[y].length(); i++) {
if(i == x) {
newString += ' ';
} else {
newString += lifeArray[y].charAt(i);
}
}
lifeArray[y] = newString;
}
@Override
public boolean isAlive(int x, int y) {
// TODO Auto-generated method stub
if(lifeArray[y].charAt(x) == '*')
return true;
return false;
}
@Override
public ILife nextGeneration() {
// TODO Auto-generated method stub
return null;
Life newWorld = new Life();
for(int y = 0; y < lifeArray.length; y++) {
for(int x = 0; x < lifeArray[y].length(); x++) {
int counter = countNeighbors(x, y);
if(isAlive(x, y)) {
if (counter > 3 || counter < 2)
newWorld.setDead(x, y);
if (counter == 3 || counter == 2)
newWorld.setAlive(x, y);
}
if(!isAlive(x, y)) {
if (counter == 3) {
newWorld.setAlive(x, y);
} else {
newWorld.setDead(x, y);
}
}
}
}
return newWorld;
}
private int countNeighbors(int x, int y) {
int counter = 0;
//count three above
counter += countAbove(x, y);
//count three below
counter += countBelow(x, y);
//count two sides
counter += countSides(x, y);
return counter;
}
private int countSides(int x, int y) {
int counter = 0;
if(x-1 >= 0)
if(isAlive(x-1, y))
counter++;
if(x+1 < lifeArray[y].length())
if(isAlive(x+1, y))
counter++;
return counter;
}
private int countBelow(int x, int y) {
int counter = 0;
if(y+1 < lifeArray.length) {
for (int i = x-1; i <= x+1; i++) {
if (i >= 0 && i < lifeArray[y+1].length())
if(isAlive(i, y + 1))
counter++;
}
}
return counter;
}
private int countAbove(int x, int y) {
int counter = 0;
if(y-1 >= 0) {
for (int i = x-1; i <= x+1; i++) {
if (i >= 0 && i < lifeArray[y-1].length())
if(isAlive(i, y - 1))
counter++;
}
}
return counter;
}
public void showBoard() {
for(int y = 0; y < lifeArray.length-1; y++)
System.out.println(Arrays.toString(new String[] {lifeArray[y]}));
}
}

39
test/LifeTest.java
View File

@ -15,6 +15,7 @@ public class LifeTest {
// Act: Berechnung der Folgegeneration
ILife nextGen = l.nextGeneration();
// Assert: Rasterpunkt mit drei Nachbarn sollte jetzt leben
assertTrue(nextGen.isAlive(1, 1));
}
@ -22,16 +23,54 @@ public class LifeTest {
@Test
public void destroyLonelyCell() {
// Arrange: drei lebende Zellen
Life l = new Life();
l.setAlive(0, 0);
l.setAlive(0, 1);
l.setAlive(0, 2);
// Act: Berechnung der Folgegeneration
ILife nextGen = l.nextGeneration();
// Assert: Rasterpunkt mit drei Nachbarn sollte jetzt leben
assertFalse(nextGen.isAlive(0, 2));
}
@Test
public void keepAliveCell() {
// Arrange: drei lebende Zellen
Life l = new Life();
l.setAlive(0, 0);
l.setAlive(0, 1);
l.setAlive(0, 2);
// Act: Berechnung der Folgegeneration
ILife nextGen = l.nextGeneration();
// Assert: Rasterpunkt mit drei Nachbarn sollte jetzt leben
assertTrue(nextGen.isAlive(0, 1));
}
@Test
public void destroyCrowdedCell() {
// Arrange: drei lebende Zellen
Life l = new Life();
l.setAlive(0, 0);
l.setAlive(0, 1);
l.setAlive(0, 2);
l.setAlive(1, 1);
l.setAlive(1, 0);
// Act: Berechnung der Folgegeneration
ILife nextGen = l.nextGeneration();
// Assert: Rasterpunkt mit drei Nachbarn sollte jetzt leben
assertFalse(nextGen.isAlive(0, 1));
}