We assume that ChessPiece has an appropriately implemented toString method, whose implementation is described below. You must include the following toString method to help debug your program. The method returns true if the move was executed, and false otherwise. If the move is legal, it executes the move, changing the value of the board as needed. Legality is defined based on the rules described above. This method checks if moving the piece from the fromPosition to toPosition is a legal move.

public boolean move(String fromPosition, String toPosition).

If successful, this method should call an appropriate method in the ChessPiece class (i.e., setPosition) to set the piece's position. The first letter is in lowercase (a.h) and the second letter is a digit (1.8). Assume that only legal strings will be used. The position is represented as a two-character string (e.g., e8) as described above. If an opponent's piece exists, that piece is captured. This method tries to place the given piece at a given position, and returns true if successful, and false if there is already a piece of the same player in the given position. public boolean placePiece(ChessPiece piece, String position).This method returns the chess piece at a given position.

This method should use the constructors of the appropriate pieces, and call placePiece below to place the newly constructed pieces in the right position. This method initializes the board to the standard chess opening state with indexing as shown in the figure.

The no-arg constructor ChessBoard() initializes the board to an 8X8 array with all empty squares.Note that initially we had rows and columns the other way around! In the initial position, the white king at e1 is at index. We will make the following association: a=0, b=1, c=2, d=3, e=4, f=5, g=6, and h=7. Since the positions on a chess board are represented using a letter followed by a number, our array needs to represent the directions accordingly. In other words, each dimension has indices 0.7. The board is represented by a 2-dimensional array of size 8X8. In a real program, it would need to store more information (e.g., whoseTurn, etc). This class only stores the state of the board and its pieces for this assignment. You will implement the eight classes described below. At the end of the move, it can occupy a previously empty square or capture (replace) an opponent's piece but it cannot replace another piece of the same player. A bishop can move any number of squares diagonally in any direction as long as it does not have to leap over other pieces.A rook can move any number of squares horizontally or vertically, forward or backward, as long as it does not have to leap over other pieces.These are the only moves we will not implement the En passant rule and will also not allow promotion to another piece if the pawn reaches the end of the column. A pawn may also capture (replace) an opponent's piece diagonally one square in front of it. Subsequently it can move only one square vertically forward to an empty square. A pawn in the initial position may move one or two squares vertically forward to an empty square but cannot leap over any piece.Since we don't know what check means, for us a move is legal if the piece we are moving has an empty square to move to or can capture (replace) an opponent's piece (including their king, although that's also illegal in real chess). Most importantly, we will ignore an important rule in chess: Moving any piece in a way that puts your own king in check is illegal. However, we will follow a simplified version in this assignment. Details of the original rules are provided here. Familiarize yourself with the names of the pieces.Įach chess piece can move in a specific way. The white king is on e1, and the black king is on e8. We are just creating a toy version that lets you set up pieces on the board, move them, and find possible moves given a certain position.īecause we are simplifying so many rules, we'll call this game, Modified chESS or MESS!Ĭhess is played on an 8 X 8 board where the initial placement of pieces is as shown in the following figure, taken from Wikipedia. The objective of this assignment is to practice concepts related to inheritance, overriding, polymorphism, and abstract classes, to program the basics of a chess playing program. CS161 Programming Assignment 4: Inheritance and the game of chess P4: Inheritance and the Game of Chess

Chess pieces moves code