Baby steps towards engine optimisation, may not be implemented in the…

… final versions

src/main/java/com/a2ys/chess/Engine.java

@@ -13,6 +13,7 @@ public class Engine {
     private final MoveGenerator moveGenerator = new MoveGenerator();
     public static List<List<List<Integer>>> ZobristTable = new ArrayList<>();
     private boolean lol = false;
+    private HashMap<Integer, ArrayList<ArrayList<ArrayList<Move>>>> moveListWithHash = new HashMap<>();
     Board board;
 
     public void initialize() {
@@ -687,4 +688,23 @@ public static int computeHash(Pieces[][] board) {
     private Board getBoard() {
         return board;
     }
+
+    private ArrayList<ArrayList<ArrayList<Move>>> getLegalMoves(Pieces[][] boardArray, Board board) throws KingCapturedError {
+        ArrayList<ArrayList<ArrayList<Move>>> allLegalMoves = new ArrayList<>();
+        String activePlayer = getActivePlayer();
+
+        for (int i = 0; i < 8; i++) {
+            ArrayList<ArrayList<Move>> rowMoves = new ArrayList<>();
+            for (int j = 0; j < 8; j++) {
+                Pieces piece = boardArray[i][j];
+                ArrayList<Move> pieceMoves = new ArrayList<>();
+                if (piece.getColor().equals(activePlayer)) {
+                    pieceMoves = getLegalMoves(moveGenerator.pseudoLegalMoves(piece, boardArray), board, boardArray);
+                }
+                rowMoves.add(j, pieceMoves);
+            }
+            allLegalMoves.add(i, rowMoves);
+        }
+        return allLegalMoves;
+    }
 }