Recursion in Chess AI
While this is a reasonable initial attempt, this is not exactly what a modern chess engine would do. In fact, even if you would code the remaining pieces (you only have pawn now), the engine wouldn't be strong.

Before that, we should clear up some chess terminology: 


We don't say simulation, we say search
The term AI is okay but even a better term would be engine


There're some very serious issues with your implementation:


You will need to account for transposition. This can be done by hashing.
You should take account of horizon effect by Quiescene Search.
You should really consider alpha-beta search or the related nega-max search.
In your code, you're just trying to brute force all moves in the deep-first fashion, this is absolutely unacceptable for chess programming. The search space will blow your code off. I repeat, you can't search every single position in chess, it's pointless.
What kind of move representation are you using? This looks like a simple array to me, maybe you'd consider a faster implementation?
Why is moving a pawn to the king is an advantage?  


Depends on what you want to achieve, if you just want to code something that moves, it's fine. Unfortunately, the current code is nowhere close to anything what a modern chess engine is expected. As an experienced engine developer, I'd rate the code zero. It has lots improvement opportunities.

Please read about alpha-beta for your next attempt.