public void Promote(Piece piece, PieceType type)
{
//The most complex code that you will ever see
piece.Type = type;
externalBoard.Promote(piece);
}
public Piece(PieceType type, PieceColour colour, Point pos)
{
Colour = colour;
Type = type;
Position = pos;
}
public bool EqualsTo(PieceType b)
{
return(string.Compare(this.pieceName, b.pieceName) == 0);
}
public static Dictionary <string, string[]> GenerateAllNonCaptureNonSpecialAlgebraicNotationMoves(PieceType pieceType, ChessColor pieceColor)
{
Dictionary <string, string[]> moveDictionary = new Dictionary <string, string[]>();
// loop through every square on the board
for (int fileCol = 0; fileCol < INT_MAX_COL_FILE; fileCol++)
{
for (int rankRow = 0; rankRow < INT_MAX_ROW_RANK; rankRow++)
{
string algebraicNotation = GetAlgebraicNotationFromRowZBTLFileRank(fileCol, rankRow);
List <string> possibleMoves = new List <string>();
string possibleMove = null;
switch (pieceType)
{
case PieceType.Pawn:
// A pawn can move forward one square, if that square is unoccupied.
// If it has not yet moved, each pawn has the option of moving two squares
// forward provided both squares in front of the pawn are unoccupied. A pawn cannot move backwards.
switch (pieceColor)
{
case ChessColor.White:
if (rankRow > 6)
{
continue;
}
possibleMove = GetAlgebraicNotationFromRowZBTLFileRank(fileCol, rankRow - 1);
if (possibleMove != null)
{
possibleMoves.Add(possibleMove);
}
if (rankRow == 6)
{
possibleMove = GetAlgebraicNotationFromRowZBTLFileRank(fileCol, rankRow - 2);
if (possibleMove != null)
{
possibleMoves.Add(possibleMove);
}
}
break;
case ChessColor.Black:
if (rankRow < 1)
{
continue;
}
possibleMove = GetAlgebraicNotationFromRowZBTLFileRank(fileCol, rankRow + 1);
if (possibleMove != null)
{
possibleMoves.Add(possibleMove);
}
if (rankRow == 1)
{
possibleMove = GetAlgebraicNotationFromRowZBTLFileRank(fileCol, rankRow + 2);
if (possibleMove != null)
{
possibleMoves.Add(possibleMove);
}
}
break;
default:
break;
}
break;
case PieceType.Rook:
// The rook moves horizontally or vertically, through any number of unoccupied squares.
// As with captures by other pieces, the rook captures by occupying the square on which the enemy piece sits.
// The rook also participates, with the king, in a special move called castling, which is not covered, here.
// Every possible move up:
for (int rankRowMove = rankRow - 1; rankRowMove >= 0; rankRowMove--)
{
possibleMove = GetAlgebraicNotationFromRowZBTLFileRank(fileCol, rankRowMove);
if (possibleMove != null)
{
possibleMoves.Add(possibleMove);
}
}
// Every possible move down:
for (int rankRowMove = rankRow + 1; rankRowMove < INT_MAX_ROW_RANK; rankRowMove++)
{
possibleMove = GetAlgebraicNotationFromRowZBTLFileRank(fileCol, rankRowMove);
if (possibleMove != null)
{
possibleMoves.Add(possibleMove);
}
}
// Every possible move right:
for (int fileColMove = fileCol + 1; fileColMove < INT_MAX_COL_FILE; fileColMove++)
{
possibleMove = GetAlgebraicNotationFromRowZBTLFileRank(fileColMove, rankRow);
if (possibleMove != null)
{
possibleMoves.Add(possibleMove);
}
}
// Every possible move left:
for (int fileColMove = fileCol - 1; fileColMove >= 0; fileColMove--)
{
possibleMove = GetAlgebraicNotationFromRowZBTLFileRank(fileColMove, rankRow);
if (possibleMove != null)
{
possibleMoves.Add(possibleMove);
}
}
break;
case PieceType.Knight:
break;
case PieceType.Bishop:
break;
case PieceType.Queen:
break;
case PieceType.King:
// King can move exactly one square horizontally, vertically, or diagonally.
// At most once in every game, each king is allowed to make a special move, known as castling.
// Castling is not handled, here; it is a special move handled by ChessBoard and states of King and Rook
// More info, here https://en.wikipedia.org/wiki/Castling
possibleMove = GetAlgebraicNotationFromRowZBTLFileRank(fileCol - 1, rankRow - 1);
if (possibleMove != null)
{
possibleMoves.Add(possibleMove);
}
possibleMove = GetAlgebraicNotationFromRowZBTLFileRank(fileCol, rankRow - 1);
if (possibleMove != null)
{
possibleMoves.Add(possibleMove);
}
possibleMove = GetAlgebraicNotationFromRowZBTLFileRank(fileCol + 1, rankRow - 1);
if (possibleMove != null)
{
possibleMoves.Add(possibleMove);
}
possibleMove = GetAlgebraicNotationFromRowZBTLFileRank(fileCol - 1, rankRow);
if (possibleMove != null)
{
possibleMoves.Add(possibleMove);
}
possibleMove = GetAlgebraicNotationFromRowZBTLFileRank(fileCol + 1, rankRow);
if (possibleMove != null)
{
possibleMoves.Add(possibleMove);
}
possibleMove = GetAlgebraicNotationFromRowZBTLFileRank(fileCol - 1, rankRow + 1);
if (possibleMove != null)
{
possibleMoves.Add(possibleMove);
}
possibleMove = GetAlgebraicNotationFromRowZBTLFileRank(fileCol, rankRow + 1);
if (possibleMove != null)
{
possibleMoves.Add(possibleMove);
}
possibleMove = GetAlgebraicNotationFromRowZBTLFileRank(fileCol + 1, rankRow + 1);
if (possibleMove != null)
{
possibleMoves.Add(possibleMove);
}
break;
default:
break;
}
moveDictionary.Add(algebraicNotation, possibleMoves.ToArray());
}
}
return(moveDictionary);
}
public Piece(Team team, PieceType pieceType)
{
Team = team;
PieceType = pieceType;
}
public void setPromotedPiece(PieceType type)
{
this.promotedPiece = promotedPawn.getPromotionPiece(type);
}
