155 lines
3.1 KiB
Java
155 lines
3.1 KiB
Java
package game;
|
|
|
|
import gui.GUI;
|
|
|
|
import java.util.concurrent.ThreadLocalRandom;
|
|
|
|
public class Control {
|
|
|
|
private GUI gui;
|
|
private Clock clock;
|
|
|
|
private int xSize, ySize, cellCount, gen = 0;
|
|
|
|
private boolean[][] cells;
|
|
private boolean[][] newcells;
|
|
|
|
|
|
|
|
public void start(){
|
|
|
|
gui = new GUI(this);
|
|
gui.controlWindow();
|
|
|
|
}
|
|
|
|
public void startGame(){
|
|
clock = new Clock();
|
|
clock.start(this);
|
|
}
|
|
|
|
public void buildGameWindow(int xSize, int ySize, int cellCount, StartMode startMode){
|
|
this.xSize = xSize;
|
|
this.ySize = ySize;
|
|
this.cellCount = cellCount;
|
|
|
|
cells = new boolean[this.xSize][this.ySize];
|
|
newcells = new boolean[this.xSize][this.ySize];
|
|
|
|
|
|
switch(startMode){
|
|
|
|
case Task1 -> {
|
|
generateTask1();
|
|
System.out.println("Taks1");
|
|
}
|
|
case Randomized -> {
|
|
generateRandomized();
|
|
System.out.println("Random");
|
|
}
|
|
case Manuel -> {
|
|
buildManuelGame();
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
private void buildManuelGame(){
|
|
|
|
}
|
|
|
|
private void generateTask1(){
|
|
for (int x = 0; x < 6; x++) {
|
|
for (int y = 0; y < 6; y++) {
|
|
cells[x][y] = false;
|
|
}
|
|
}
|
|
|
|
cells[1][2] = true;
|
|
cells[2][2] = true;
|
|
cells[2][4] = true;
|
|
cells[3][1] = true;
|
|
cells[3][3] = true;
|
|
cells[4][3] = true;
|
|
|
|
syncCells();
|
|
}
|
|
|
|
private void generateRandomized(){
|
|
for (int i = 0; i < this.cellCount; i++) {
|
|
int x = rand(0, this.xSize);
|
|
int y = rand(0, this.ySize);
|
|
this.cells[x][y] = true;
|
|
}
|
|
syncCells();
|
|
}
|
|
|
|
private void syncCells(){
|
|
for (int x = 0; x < this.xSize; x++) {
|
|
for (int y = 0; y < this.ySize; y++) {
|
|
this.newcells[x][y] = this.cells[x][y];
|
|
}
|
|
}
|
|
}
|
|
|
|
public void nextGen(){
|
|
gen ++;
|
|
System.out.println("Generation:" + gen);
|
|
|
|
for (int x = 0; x < xSize; x++){
|
|
for (int y = 0; y < ySize; y++) {
|
|
int n = aliveNeigbours(x, y);
|
|
|
|
if (n == 3 && !cells[x][y]){
|
|
newcells[x][y] = true;
|
|
}
|
|
|
|
if (n < 2){
|
|
newcells[x][y] = false;
|
|
}
|
|
|
|
if (n == 2 || n == 3){
|
|
|
|
}
|
|
|
|
if (n > 3){
|
|
newcells[x][y] = false;
|
|
}
|
|
|
|
}
|
|
}
|
|
|
|
syncCells();
|
|
|
|
}
|
|
|
|
|
|
private int aliveNeigbours(int x, int y){
|
|
int count = 0;
|
|
|
|
int[] xoff = {1, 1, 0, -1, -1, -1, 0, 1};
|
|
int[] yoff = {0, 1, 1, 1, 0, -1, -1, -1};
|
|
|
|
for (int i = 0; i < 8; i++){
|
|
try {
|
|
if (cells[x + xoff[i]][y + yoff[i]]){
|
|
count ++;
|
|
}
|
|
} catch (Exception e) {
|
|
}
|
|
}
|
|
return count;
|
|
}
|
|
|
|
|
|
private int rand(int min, int max){
|
|
return ThreadLocalRandom.current().nextInt(min, max);
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
|