Comment by _ache_

The algorithm behind it is very basic.

Chose the most aggressive move (in term of pieces value and check-mate), if none is aggressive, it takes on of the move equally non aggressive.

Didn't remember the depth of the algorithm but it was very simple C code, could check quickly. It should be able to find a mate in 2 or 3 if it was in position of having one.

I didn't check the correctness of the algorithm, just the intention.