Games with Imperfect Information

摘要: An information set in a game tree is of nodes from which the rules require that same alternative (i.e., move) be selected. Thus an are indistinguishable to player moving set, thereby reflecting imperfect information, is, hidden player. Information sets arise naturally (for example) card gaines like poker and bridge. IIere we focus not on solution concept for games (which has been studied at length), but rather computational aspects such games: how hard it compute solutions? We present two fundainental results games. The first result shows even if there only single player, must seek special cases or heuristics. second complements first, providing efficient algorithm just case. Additionally, show our case can used as heuristic general