Checkers Game

Game of CheckersTable revised for university project by Luca Rubino and Renato Esposito
(PROGRAMMING III AND PROGRAMMING LABORATORY III - course of the Parthenope University of Naples).

Design Patterns in this project: Singleton, Observer, Factory Method, Memento, Command, Prototype.

Game Rules:

Each player has N pieces where N is a number that varies according to size of the playing field that is chosen by the player before starting one match. The following pieces are present on the playing field:

• Pawn: classic piece of the game of checkers that represents that she can move into diagonal one square at a time and only forward. When a Pawn reaches one of the boxes in the last row and is promoted by becoming a Checkers. There Pawn can eat the opponent's pieces that are forward on the square diagonal next to theirs and that they have the next free square.
• Checkers: classic piece of the checkers game that represents the upgrade of the pawn. It can move in multiple directions one step at a time. He can eat any other piece.
• Wizard (Revised Mode only): Can move in multiple directions at one step time. If he eats a piece he resurrects a Checkers instead of the eaten piece. If it is eaten by an opponent's piece, the opponent's piece becomes a Checkers. A wizard cannot become a Checkers and cannot eat another Wizard.

When a player eats an opponent's piece he scores points based on the piece eaten, in particular:

• Pawn: 1 point.
• Wizard: 3 points.
• Checkers: 5 points.

The game ends when one of the following situations occurs:

A player runs out of all his pieces. A player leaves the game. The timer expires and in this case the winner is determined on the basis of the score higher. If the players have the same score then the game is considered "draw".

A piece must eat when it can eat to be able to move.
Player1 always makes the first move.

OUTPUT EXAMPLE (Green: Player1, Red: Player2)