This paper deals with a full-information two-person best-choice game with disorder where players have random priorities described by lottery. The aim of the players is to choose the maximal observation of the random sequence. Each player has a one-threshold strategy. Expected payoffs are derived. The asymptotic and the particular solutions are also studied. Numerical examples are given.