Utveckling av minimax-baserad agent för strategispelet Stratego
Stratego is a boardgame not very different from chess, that contains hidden information. Because of this, existing programs play at beginner level. The purpose of this thesis is to adjust a minimax algorithm so that it passes the demands of Stratego, and then build a Stratego agent around it. Tests with existing minimax algorithms leads to the development p-e-minimax. This algorithm uses two diffe
