Ok... I have a game of imperfect information and I want to compute its Minimax Value.From the lectures I know that in order to find the value for a Perfect information game I can use tree search methods.Also I know that this problem for Imperfect information games is NP-hard.But if the game tree is very small can I use alpha-beta pruning for example?Someone told me that I cant but I cannot understand why.
Tree search on game of Imperfect Information
1
$\begingroup$
game-theory