Chess-Collision-Detection

Basic collision detection exercise as part of a university module. Deals with square and circle collisions. When run, a game will be created and generate a predefined number of pieces of random type. The pieces will then move automatically in small increments for a arbitrary number of moves until either

• There is only one piece left on the board
• The game has reached the indicated number of moves

After which it will print the scoreboard.

Structure

1. Game: Handles all the actions of the pieces and tracks the score of the game
2. Piece: Abstract class from which all the other pieces inherit

Output