Module ImportFrom alias alias alias ImportFrom alias alias alias alias FunctionDef arguments args NameParam NameParam NameParam defaults NameLoad NameLoad body Expr Str Return Call NameLoad NameLoad Call NameLoad keyword NameLoad keyword NameLoad decorator_list FunctionDef arguments args NameParam NameParam NameParam defaults NameLoad NameLoad body Expr Str Return Call NameLoad NameLoad Call NameLoad keyword NameLoad keyword NameLoad decorator_list FunctionDef arguments args NameParam NameParam NameParam NameParam defaults NameLoad NameLoad body Expr Str Return Call NameLoad NameLoad Call NameLoad keyword NameLoad keyword NameLoad keyword NameLoad decorator_list FunctionDef arguments args NameParam NameParam NameParam defaults NameLoad NameLoad body Expr Str Assign NameStore NameLoad Assign NameStore Num While UnaryOpNot NameLoad body Assign NameStore Call NameLoad NameLoad keyword NameLoad keyword NameLoad keyword NameLoad AugAssignAdd NameStore Num If NameLoad body Expr Call AttributeLoad NameLoad attr Str NameLoad BinOpMod Str NameLoad Return NameLoad decorator_list FunctionDef arguments args NameParam NameParam NameParam defaults NameLoad NameLoad body Expr Str Return Call NameLoad NameLoad Call NameLoad keyword NameLoad keyword NameLoad keyword NameLoad keyword NameLoad decorator_list FunctionDef arguments args NameParam NameParam NameParam defaults NameLoad NameLoad body Expr Str Return Call NameLoad NameLoad Call NameLoad keyword NameLoad keyword NameLoad keyword NameLoad keyword NameLoad decorator_list FunctionDef arguments args NameParam NameParam NameParam defaults NameLoad NameLoad body Expr Str Return Call NameLoad NameLoad Call NameLoad keyword NameLoad keyword NameLoad keyword NameLoad keyword NameLoad decorator_list FunctionDef arguments args NameParam NameParam NameParam NameParam NameParam NameParam NameParam defaults NameLoad NameLoad NameLoad NameLoad NameLoad body Expr Str If NameLoad body Expr Call AttributeLoad NameLoad attr Str Assign NameStore Call NameLoad Assign NameStore Call NameLoad keyword AttributeLoad NameLoad attr keyword NameLoad Expr Call AttributeLoad NameLoad attr NameLoad While NameLoad body If NameLoad body Expr Call AttributeLoad NameLoad attr Str Call AttributeLoad NameLoad attr Assign NameStore Call AttributeLoad NameLoad attr If Call AttributeLoad NameLoad attr AttributeLoad NameLoad attr body If NameLoad body Expr Call AttributeLoad NameLoad attr Str NameLoad NameLoad Expr Call AttributeLoad NameLoad attr Str Call AttributeLoad NameLoad attr NameLoad Str Return NameLoad orelse If NameLoad body Expr Call AttributeLoad NameLoad attr Str NameLoad NameLoad Expr Call AttributeLoad NameLoad attr AttributeLoad NameLoad attr If BoolOpOr CompareIs NameLoad NameLoad CompareLt AttributeLoad NameLoad attr NameLoad body Assign NameStore Call AttributeLoad NameLoad attr If NameLoad body Expr Call AttributeLoad NameLoad attr Str ListLoad NameLoad ListLoad NameLoad For NameStore NameLoad body If NameLoad body Assign NameStore ListComp NameLoad comprehension NameStore NameLoad CompareEq AttributeLoad NameLoad attr AttributeLoad NameLoad attr Assert CompareIn Call NameLoad NameLoad TupleLoad Num Num If BoolOpAnd CompareNotIn AttributeLoad NameLoad attr NameLoad CompareEq Call NameLoad NameLoad Num body Expr Call AttributeLoad NameLoad attr NameLoad orelse If BoolOpAnd NameLoad CompareGt Call NameLoad NameLoad Num CompareLt NameLoad SubscriptLoad NameLoad Index Num body Expr Call AttributeLoad NameLoad attr SubscriptLoad NameLoad Index Num Expr Call AttributeLoad NameLoad attr NameLoad orelse Expr Call AttributeLoad NameLoad attr NameLoad If NameLoad body Expr Call AttributeLoad NameLoad attr Str Call AttributeLoad NameLoad attr NameLoad Str decorator_list
N/A simpleai.search.utils FifoList BoundedPriorityQueue LifoList simpleai.search.models SearchNode SearchNodeHeuristicOrdered SearchNodeStarOrdered SearchNodeCostOrdered breadth_first N/A N/A problem graph_search viewer N/A False None N/A N/A 
    Breadth first search.

    If graph_search=True, will avoid exploring repeated states.
    Requires: SearchProblem.actions, SearchProblem.result, and
    SearchProblem.is_goal.
     N/A N/A _search problem N/A FifoList graph_search graph_search viewer viewer N/A depth_first N/A N/A problem graph_search viewer N/A False None N/A N/A 
    Depth first search.

    If graph_search=True, will avoid exploring repeated states.
    Requires: SearchProblem.actions, SearchProblem.result, and
    SearchProblem.is_goal.
     N/A N/A _search problem N/A LifoList graph_search graph_search viewer viewer N/A limited_depth_first N/A N/A problem depth_limit graph_search viewer N/A False None N/A N/A 
    Limited depth first search.

    Depth_limit is the maximum depth allowed, being depth 0 the initial state.
    If graph_search=True, will avoid exploring repeated states.
    Requires: SearchProblem.actions, SearchProblem.result, and
    SearchProblem.is_goal.
     N/A N/A _search problem N/A LifoList graph_search graph_search depth_limit depth_limit viewer viewer N/A iterative_limited_depth_first N/A N/A problem graph_search viewer N/A False None N/A N/A 
    Iterative limited depth first search.

    If graph_search=True, will avoid exploring repeated states.
    Requires: SearchProblem.actions, SearchProblem.result, and
    SearchProblem.is_goal.
     N/A solution None N/A limit 0 N/A N/A solution N/A N/A solution N/A limited_depth_first problem depth_limit limit graph_search graph_search viewer viewer N/A limit 1 N/A viewer N/A N/A N/A N/A viewer event no_more_runs solution N/A returned after %i runs limit N/A solution N/A uniform_cost N/A N/A problem graph_search viewer N/A False None N/A N/A 
    Uniform cost search.

    If graph_search=True, will avoid exploring repeated states.
    Requires: SearchProblem.actions, SearchProblem.result,
    SearchProblem.is_goal, and SearchProblem.cost.
     N/A N/A _search problem N/A BoundedPriorityQueue graph_search graph_search node_factory SearchNodeCostOrdered graph_replace_when_better True viewer viewer N/A greedy N/A N/A problem graph_search viewer N/A False None N/A N/A 
    Greedy search.

    If graph_search=True, will avoid exploring repeated states.
    Requires: SearchProblem.actions, SearchProblem.result,
    SearchProblem.is_goal, SearchProblem.cost, and SearchProblem.heuristic.
     N/A N/A _search problem N/A BoundedPriorityQueue graph_search graph_search node_factory SearchNodeHeuristicOrdered graph_replace_when_better True viewer viewer N/A astar N/A N/A problem graph_search viewer N/A False None N/A N/A 
    A* search.

    If graph_search=True, will avoid exploring repeated states.
    Requires: SearchProblem.actions, SearchProblem.result,
    SearchProblem.is_goal, SearchProblem.cost, and SearchProblem.heuristic.
     N/A N/A _search problem N/A BoundedPriorityQueue graph_search graph_search node_factory SearchNodeStarOrdered graph_replace_when_better True viewer viewer N/A _search N/A N/A problem fringe graph_search depth_limit node_factory graph_replace_when_better viewer N/A False None SearchNode False None N/A N/A 
    Basic search algorithm, base of all the other search algorithms.
     N/A viewer N/A N/A N/A N/A viewer event started N/A memory N/A set N/A initial_node N/A node_factory state N/A problem initial_state problem problem N/A N/A N/A fringe append initial_node N/A fringe N/A N/A viewer N/A N/A N/A N/A viewer event new_iteration N/A N/A fringe sorted N/A node N/A N/A fringe pop N/A N/A N/A problem is_goal N/A node state N/A N/A viewer N/A N/A N/A N/A viewer event chosen_node node True N/A N/A N/A viewer event finished N/A N/A fringe sorted node goal found N/A node N/A N/A viewer N/A N/A N/A N/A viewer event chosen_node node False N/A N/A N/A memory add N/A node state N/A N/A N/A depth_limit None N/A N/A node depth depth_limit N/A N/A expanded N/A N/A node expand N/A viewer N/A N/A N/A N/A viewer event expanded N/A node N/A expanded N/A n expanded N/A N/A graph_search N/A N/A others N/A x N/A x fringe N/A N/A x state N/A n state N/A N/A N/A len others N/A 0 1 N/A N/A N/A N/A n state memory N/A N/A len others 0 N/A N/A N/A N/A fringe append n N/A N/A N/A graph_replace_when_better N/A N/A len others 0 N/A n N/A others N/A 0 N/A N/A N/A N/A fringe remove N/A others N/A 0 N/A N/A N/A fringe append n N/A N/A N/A N/A fringe append n N/A viewer N/A N/A N/A N/A viewer event finished N/A N/A fringe sorted None goal not found N/A