Searching Boxes With Unequal Stakes

A searcher chooses one of three boxes to inspect; a hider chooses one box to hide in. If the searcher picks the correct box, the searcher earns the box's value; otherwise the payoff is $0$. The three box values are $6$, $3$, and $2$. Find the searcher's optimal mixed strategy and the value of the game.