I've got a problem with solving "game problems" (in programming/algorithm contests) (I don't know how they're named). Generaly the problem is:
there is an area(usually an array - 1D, 2D or something like a tree etc.) and there are 2 players who have to move pawns in that array. You must write a program which do right moves (is a player) (but there are always right moves - you can always win if you do them). That programs must win with other programs, libary etc.
Has anyone an idea/algorithm/good tutorial which describe method of solving that problems?
Is it connected with a "game theory" ???
Thanks for a help.