Nontrivial monotone weakly symmetric Boolean functions with six variables are elusive

AbstractA Boolean function f(x1,…,xn) is elusive if every decision tree evaluating f must examine all n variables in the worst case. Rivest and Vuillemin conjectured that every nontrivial monotone weakly symmetric Boolean function is elusive. In this note, we show that this conjecture is true for n = 6