fftree, and permutates given
cues in all possible variants
to find a permutation of cues, which has the highest value of
Sdt. Careful: This may take a LONG while!
string; Which parameter of the tree should be maximized? See Sdt for possible values.
This is the most inefficient method, but the most secure. For a more performant approach with similar results, use maximize instead. Everything from Sdt can be maximized.
list with best cues
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.