In this sesmeter, my project will be to build a game called Othello. This game involves two players where the winner is the one who has the most board locations at the end of the game. Othello is considered an AI game, as the computer has to decide the best movement which requires looking at all possible movements. To do this, we need an algorithm to deal with huge numbers of possibilities in a short time. Some of these algorithms are minimax and Alpha-beta pruning algorithm.
I am planning to build a game which allows two players to play against each other or one to play against the computer. The algorithm that I will use is Negamax and Alpha Beta Pruning.
2009-2010
http://www.tjhsst.edu/~rlatimer/techlab10/Per5/FourthQuarter/ChenPaperQ4-10.pdf
2007
https://dke.maastrichtuniversity.nl/pim.nijssen/pub/bsc.pdf
http://en.wikipedia.org/wiki/Computer_Othello#cite_note-13