Erik Andskär

Chinese Checkers | Unity

Mini-Max Algorithm

— PROJECT NAME

Chinese Checkers


— ROLE

Solo


— DURATION

3 Weeks


— TEAM SIZE

Solo

The player has to compete against the computer in the classic game Chinese Checkers, the algorithm I used and learned about for this project was mini-max, which minimizes the possible loss and maximizes the possible gain that the Computer can achieve. This was a perfect fit for Chinese checkers.


Chinese checkers was a project made during a programming course where I learned about data structures and algorithms. The code and structure followed the model → view→ (MVC) pattern.

The algorithm for minimax is done in branching iterations to iterate the best move.

IMPROVEMENTS

The game is a single-player experience with up to 5 computer opponents. A big improvement for the game would be focusing on making it into a party game where the number of human players and computer opponents can be specified.


In addition, the game could have included an overlay for available moves when selecting a piece, to help the player play.