  {\alpha}{\mu} is an anytime heuristic search algorithm for incomplete
information games that assumes perfect information for the opponents.
{\alpha}{\mu} addresses the strategy fusion and non-locality problems
encountered by Perfect Information Monte Carlo sampling. In this paper
{\alpha}{\mu} is applied to the game of Bridge.
