It's still in a very early stage, and could be greatly improved. Graphics are temporary & ugly.
But here it is:
There's no detection for check or mate yet, but the computer will never leave itself in check (unless it is mate). Castling is supported, 'en passant' isn't. It's slow and not really strong and most people should win from it.
For those who know something about computer chess (I knew nothing when I wrote it):
Apparently it uses some kind of improvised alpha-beta optimization, with very primitive move sorting. It has a fixed PLY of 4 (PLY can be changed in the source code).
In the meanwhile I've read a bit about computer chess, and would like to rewrite the whole thing using 'bitboards' (but I don't know if bitwise calculations in AS are fast enough), variable PLY, better evaluation and better move sorting. Does anyone have experience with this?
All suggestions welcome, and thanks for checking!