As a term paper on Intelligent Systems wrote a game of checkers.
Opportunities:
- Russian and international drafts
- select player color
- setting the depth of search
- view history of moves
- checking the compliance of the player’s turn with the rules
- highlighting the possible course options

')
The algorithm uses the minimax approach with alpha-beta clipping. It is written using the Qt4 library and must be successfully compiled into windows, linux, etc. View models are not. Memory flows. Everything is written naturally not optimally. But it works :) Maybe someone will come in handy.
Code posted on
Google Code . I recommend taking the version from svn, as I will not often update the archives. Although the svn update does not guarantee :)