  We study a variation of the game of best choice (also known as the secretary
problem or game of googol) under an additional assumption that the ranks of
interview candidates are restricted using permutation pattern-avoidance. We
describe the optimal positional strategies and develop formulas for the
probability of winning.
