Trees | Indices | Help |
|
---|
|
Functions | |||
|
Variables | |
__package__ = None hash(x) |
Function Details |
A breadth-first beam search. B = max number of options to keep, E = max cost difference between best and worst threads in beam. initial = [ starting positions ] extra = arbitrary information for cost function. cost = fn(state, extra) -> (total_cost, [next states], output_if_goal) |
Trees | Indices | Help |
|
---|
Generated by Epydoc 3.0.1 on Thu Sep 22 04:25:02 2011 | http://epydoc.sourceforge.net |