A Boolean Function f(x(1), ..., x(n)) is elusive if every decision tree eva
luating f must examine all n variables in the worst case. Rivest and Vuille
min conjectured that every nontrivial monotone weakly symmetric Boolean fun
ction is elusive. In this note, we show that this conjecture is true for n
= 10. (C) 1999 Academic Press.