/*
- * Copyright (c) 2018. Developed by Hedgecode.
+ * Copyright (c) 2018-2019. Developed by Hedgecode.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
byte[] pieces = new byte[2 * (squarePieces.size() + 1)];
int i = 0;
switch (piece) {
- case PAWN:
+ case Piece.PAWN:
pieces[i++] = TCD.PAWN;
break;
- case KNIGHT:
+ case Piece.KNIGHT:
pieces[i++] = TCD.KNIGHT;
break;
- case BISHOP:
+ case Piece.BISHOP:
pieces[i++] = TCD.BISHOP;
break;
- case ROOK:
+ case Piece.ROOK:
pieces[i++] = TCD.ROOK;
break;
- case QUEEN:
+ case Piece.QUEEN:
pieces[i++] = TCD.QUEEN;
break;
- case KING:
+ case Piece.KING:
pieces[i++] = TCD.KING;
break;
}
if (castle != null) {
byte castleByte;
switch (castle) {
- case KING:
+ case Castle.KING:
castleByte = TCD.CASTLE_KING;
break;
- case QUEEN:
+ case Castle.QUEEN:
castleByte = TCD.CASTLE_QUEEN;
break;
- case BOTH:
+ case Castle.BOTH:
castleByte = TCD.CASTLE_BOTH;
break;
default: