AI in Games, Adversary Search
I learnt how to represent games as a search problem, defining the starting states, rules, goal test, etc on games like othello, tic tac toe, using mini-max algorithm, alpha beta pruning when the branches of the search tree need not be considered. Also to deal with time limit on adversary search ,iterative deepening search is useful.
Leave a Reply