Xiaohan Yu
Jian Pan
Big Priest(team_name)
This android app is wrote by Kotlin. This game can be applied player vs player( based on firebase ).
The AI part, using minmax-alaphbeta pruning alorithm to do (extra content writen by JAVA). A chess game may allow user to play verses AI
It is applied minimax algorithm with alpha-beta pruning. The depth of algorithm is 1, 3 and 5. This application allow the user adjust the difficult of AI. In the game user interface, we can see easy, middle, hard options that represents the different AI (the depth of minmax algorithm)
A minimax algorithm is a recursive algorithm for choosing the next move in an n-player game, usually a two-player game. Alpha'96beta pruning is a search algorithm that seeks to decrease the number of nodes that are evaluated by the minimax algorithm in its search tree. For example:
More information you can see it at https://en.wikipedia.org/wiki/Alpha%E2%80%93beta_pruning
or watch a video alpha beta prunning
https://github.com/jeromepan/ooc_project/blob/master/chess.pptx