Maximizes a Sdt value by bruteforcing the tree permutation

Description

Takes given fftree, and permutates given cues in all possible variants to find a permutation of cues, which has the highest value of whatToMaximize in Sdt. Careful: This may take a LONG while!

Usage

1
fftm.bruteforce.maximize(tree, whatToMaximize)

Arguments

tree

fftree

whatToMaximize

string; Which parameter of the tree should be maximized? See Sdt for possible values.

Details

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.

Value

list with best cues

See Also

Fftm, maximize, chase, , montecarlo

Want to suggest features or report bugs for rdrr.io? Use the GitHub issue tracker.