Checkers AI

hey I am making a checkers game, and I havent done any AI beofre so if someone coule point me in the right ditection taht would rule.

Google alpha-beta trees.

Minimax is your basic algorithm. It’s a depth-first search with a function for evaluating game positions.

Alpha-beta is a way of pruning irrelevant branches of the tree to make the search faster.

k, I am googling minimax, thx for the help.

Some good coverage here.
You should google ‘AI board evaluation’ also.

is this a command? moves <- GenerateMoves(game);
it uses it a lot in the end. or is it jsut a representation of something.

That’s an assignment; something like this in Java, for example:

MovesStructure moves = generateMoves(game);

so do I make MoveseStructer a class?

sry I am asking dumb questions I jsut havent ever done any AI.

k I found the source code, that made it harder and easier sort of. Their code is structured different than mine. casue the done have slick :P. so they dont have tiledmaps so tehy make a class for the board.