A Boolean function f(x(1),...,x(n)) is elusive if every decision tree evalu
ating f must examine all n variables in the worst case. Rivest and Vuillemi
n conjectured that every nontrivial monotone weakly symmetric Boolean funct
ion is elusive, In this note, we show that this conjecture is true for n =
6. (C) 1999 Elsevier Science B.V. All rights reserved.