[Java] короткий метод сравнения двух объектов

package life;

import ...

class Life {
	
	static final int WIDTH = 9,
					   HEIGHT = 9;
	
	int[][] board;
	
	int totalSteps, maxPeriod;
	
	CoordinateRow alives;
	
	GameHistory game;
	
	PrintStream log;
	
	LifeUserInterface ui;
	
	Life() {
		
		board = new int[WIDTH][HEIGHT];
		
		alives = new CoordinateRow();
		
		game = new GameHistory();
		
		log = new PrintStream(System.out);
		
		ui = UserInterfaceFactory.geefLifeUI(WIDTH, HEIGHT);
		UIHulpMethodes.vraagGebruikerOmInvoer();
	}
	
	
	boolean isAlive(Coordinate alive) {
		
		for (int i = 0; i < game.history[game.lastStep()].amountOfCoordinates; i++) {
			if (alive.x == game.history[game.lastStep()].coordinatesRow[i].x) {
				if (alive.y == game.history[game.lastStep()].coordinatesRow[i].y) {
					return true;
				}
			}
		}
		return false;
	}
	
	
	int neighbors(Coordinate cell) {
		int amountOfneighbors = 0;
		
		for (int h = 0; h < 3; h++) {
			for (int w = 0; w < 3; w++) {
				Coordinate neighbor = new Coordinate(cell.x + w - 1, cell.y + h - 1);
				
					if (isAlive(neighbor)) { amountOfneighbors += 1; }
			}
		}
		
		return amountOfneighbors;
	}
	
	
	void playStep() {
		
		for (int y = 0; y < board.length; y++) {
			for (int x = 0; x < board[y].length; x++) {
				
				Coordinate cell = new Coordinate(x, y);
				
					if (isAlive(cell)) {
						int neighbors = neighbors(cell) - 1;
						
						if (neighbors < 2 || neighbors > 3) {
							alives.removeFromRow(cell);
						}
					}
					
					else { 
						
						if (neighbors(cell) == 3)  {
							alives.addOneAfterRow(cell);
						}
					}
			}
		}
	}
	
	
	
	void showBoard() ...
	
	
	...

	
	void readGame() {...
	}
	
	
	void start() {
		readGame();
		
		showBoard();
		
		for (int step = 0; step < totalSteps; step++) {
			
			game.addOneToHistory(alives.lastStep());
			
			playStep();
			
			showBoard();
			
			checkPeriod(step);
		}
		
		log.println("Game ended. Max was reached. Total amount of steps: " + totalSteps);
		System.exit(1);
	}
	
	
	public static void main(String[] argv) {
		new Life().start();
	}
}

package life;

class GameHistory {
	
	static final int MAX_AMOUNT_TURNS = 10000;
	
	CoordinateRow[] history;
	
	int amountOfTurns;
	
	GameHistory() {
		
		history = new CoordinateRow[MAX_AMOUNT_TURNS];
		
		amountOfTurns = 0;
	}
	
	
	void addOneToHistory(CoordinateRow currentGeneration) {
		history[amountOfTurns] = currentGeneration;
		amountOfTurns += 1;
	}
	
	
	int lastStep () {
		int last = this.amountOfTurns - 1;
		
		return last;
	}
}

package life;

class CoordinateRow {

	static final int MAX_AMOUNT_COORDINATES = 1000; //

	Coordinate[] coordinatesRow;

	int amountOfCoordinates;

	CoordinateRow() {

		coordinatesRow = new Coordinate[MAX_AMOUNT_COORDINATES];

		amountOfCoordinates = 0;

	}
	
	
	CoordinateRow lastStep () {
		
		CoordinateRow next = new CoordinateRow();
		
		for (int i = 0; i < amountOfCoordinates; i++) {
			Coordinate temp = new Coordinate(coordinatesRow[i].x, coordinatesRow[i].y);
			next.addOneAfterRow(temp);
		}
		
		return next;
	}
	

	void addOneAfterRow(Coordinate currentCoordinate) {
		coordinatesRow[amountOfCoordinates] = currentCoordinate;
		amountOfCoordinates += 1;
	}

	void removeFromRow(Coordinate currentCoordinate) {
		for (int i = 0; i < amountOfCoordinates; i++) {
			if (currentCoordinate.x == coordinatesRow[i].x) {
				if (currentCoordinate.y == coordinatesRow[i].y) {
					coordinatesRow[i] = coordinatesRow[amountOfCoordinates - 1];
					amountOfCoordinates -= 1;
				}
			}
		}
	}
}

int mask[][] = new int[3][3];
mask[0][0]=1;
mask[1][1]=1;
mask[2][2]=1;
mask[0][2]=1;
mask[2][0]=1;//крестик

//искать
int counter = 0;

for(int i=0;i<9;i++) for(int j=0;j<9;j++)
{
   if(board[i][j] == 1)
   { 
      for(int i1=0;i1<3;i1++) for(int j1=0;j1<3;j1++)
      {
          if(board[i1+i,j2+j] != mask[i1,j1]) 
             break;
          else if((i1==3) && (j1 ==3)) counter++;
      }
   }
}

**
  **

{"5.5", "5.6", "6.6"};

{"7.7","7.8","8.8"};