Recursive AIs

Does anyone know of tutorials on how to write effective recursive AIs? Usually implemented in turn based games like chess? thanks

>>Usually implemented in turn based games like chess?
I don't know of any tutorials, but you can search for algorithms and search strategies like minimax, pruning, killer move, transpose tables, etc...

The cprogramming main page has a link to an AI site (named AIHorizon I think) which has info on what you are looking for, including many links.

The cprogramming main page has a link to an AI site (named AIHorizon I think) which has info on what you are looking for, including many links.

thanks, ill check that out. :)

I am in the process of finishing my chess game with AI for my class project... I had recently posted my chess game here but without AI(i.e is two players..)...


There are many ways to do that.. like the greedy method, etc.. My chess games AI is some what primitive and can be easily be beaten... I have evolved a point scheme where the board state gets points for both black an white based on the position, atacks, future possible kills (oly 1 net step though..:D)... etc.. then i run a recursive function to generate all possible moves for the next state of the board.... You can say i go to the depth of a maximum of three levels..(takes lot of time) then the best point move is made... This is one of the simplest possible chess AI.. now i can easily predict what my AI algorithm is goinf to play after a move..