ActionSearch

fun interface ActionSearch(source)

How a rule searches ActionSet for its best member. Model-independent, which is why it belongs to the library: the loop is the same for every value-function and cost-function policy ever written, and only the scoring differs.

Inheritors

Functions

Link copied to clipboard
abstract fun best(actions: ActionSet, score: (DoubleArray) -> Double): DoubleArray?

The action minimising score, or null when the set is empty. score is called at most once per candidate and must be pure.