pretty cool

app/src/main/java/chess/model/ChessBoard.java

@@ -1,5 +1,11 @@
 package chess.model;
 
+import chess.model.pieces.Bishop;
+import chess.model.pieces.King;
+import chess.model.pieces.Knight;
+import chess.model.pieces.Pawn;
+import chess.model.pieces.Queen;
+import chess.model.pieces.Rook;
 import chess.model.visitor.KingIdentifier;
 import chess.model.visitor.PiecePathChecker;
 
@@ -30,6 +36,7 @@ public class ChessBoard {
 				this.cells[i][j] = new Cell();
 			}
 		}
+		initPieces();
 	}
 
 	public void applyMove(Move move) {
@@ -41,6 +48,7 @@ public class ChessBoard {
 		Piece movingPiece = pieceAt(move.getStart());
 		pieceComes(movingPiece, move.getFinish());
 		pieceLeaves(move.getStart());
+		movingPiece.move();
 	}
 
 	public void undoMove(Move move) {
@@ -52,7 +60,8 @@ public class ChessBoard {
 	}
 
 	public Piece pieceAt(Coordinate coordinate) {
-		assert (coordinate.isValid());
+		if (!coordinate.isValid())
+			return null;
 		return cellAt(coordinate).getPiece();
 	}
 
@@ -103,10 +112,56 @@ public class ChessBoard {
 					continue;
 
 				PiecePathChecker checker = new PiecePathChecker(this, new Move(attackCoords, kingPos));
-				if (checker.isValidForPiece(attackPiece))
+				if (checker.isValid())
 					return true;
 			}
 		}
 		return false;
 	}
+
+	public boolean[][] getAllowedMoves(Coordinate pieceCoords) {
+		Piece piece = pieceAt(pieceCoords);
+		if (piece == null)
+			return null;
+
+		boolean[][] result = new boolean[Coordinate.VALUE_MAX][Coordinate.VALUE_MAX];	
+		for (int i = 0; i < Coordinate.VALUE_MAX; i++) {
+			for (int j = 0; j < Coordinate.VALUE_MAX; j++) {
+				PiecePathChecker piecePathChecker = new PiecePathChecker(this, new Move(pieceCoords, new Coordinate(i, j)));
+				result[i][j] = piecePathChecker.isValid();
+			}
+		}
+		return result;
+	}
+
+	public void initPieces() {
+		for (int i = 0; i < 8; i++) {
+			pieceComes(new Pawn(Color.Black), new Coordinate(i, 0));
+			pieceComes(new Pawn(Color.White), new Coordinate(i, Coordinate.VALUE_MAX - 1));
+		}
+
+		pieceComes(new Rook(Color.Black), new Coordinate(0, 1));
+		pieceComes(new Rook(Color.Black), new Coordinate(Coordinate.VALUE_MAX - 1, 1));
+
+		pieceComes(new Rook(Color.White), new Coordinate(0, Coordinate.VALUE_MAX - 2));
+		pieceComes(new Rook(Color.White), new Coordinate(Coordinate.VALUE_MAX - 1, Coordinate.VALUE_MAX - 2));
+
+		pieceComes(new Knight(Color.Black), new Coordinate(1, 1));
+		pieceComes(new Knight(Color.Black), new Coordinate(Coordinate.VALUE_MAX - 2, 1));
+
+		pieceComes(new Knight(Color.White), new Coordinate(1, Coordinate.VALUE_MAX - 2));
+		pieceComes(new Knight(Color.White), new Coordinate(Coordinate.VALUE_MAX - 2, Coordinate.VALUE_MAX - 2));
+
+		pieceComes(new Bishop(Color.Black), new Coordinate(2, 1));
+		pieceComes(new Bishop(Color.Black), new Coordinate(Coordinate.VALUE_MAX - 3, 1));
+
+		pieceComes(new Bishop(Color.White), new Coordinate(2, Coordinate.VALUE_MAX - 2));
+		pieceComes(new Bishop(Color.White), new Coordinate(Coordinate.VALUE_MAX - 3, Coordinate.VALUE_MAX - 2));
+
+		pieceComes(new Queen(Color.Black), new Coordinate(4, 1));
+		pieceComes(new King(Color.Black), new Coordinate(3, 1));
+
+		pieceComes(new Queen(Color.White), new Coordinate(4, Coordinate.VALUE_MAX - 2));
+		pieceComes(new King(Color.White), new Coordinate(3, Coordinate.VALUE_MAX - 2));
+	}
 }