Some C code that does a good job playing Othello (AKA Reversi) using the minimax algorithm with pruning. The evaluation
function is mostly positional except that it favours raw colour count near the end-game (which may be a bad idea).
Setting the 'ply' to about 10 results in a few seconds per move. I believe I can't beat it at this setting, but haven't
tried recently. Give it a shot yourself.
I would tackle the game of Go next, but that ship has already sailed.
The project files (VS 2015 Community) and source code are here:
Play a game here: