Defines the type of Nodes that searches work over.

Defines the type of the step function that produces new states from existing ones. This is how the graph over the search space is defined.

Defines the type of a bundle of operators that need to be supplied to conduct an uninformed (non-heuristic) search.

Defines the possible outcomes of a search.

Performs an uninformed search.

Steps a search result, to produce the next result. * The result of this function may be an Ongoing search. This will provide the current head search node and a continuation to run the remainder of the search.

Continues a search result, to produce the next search goal. * The result of this function will never be an Ongoing search. This function will recursively apply the search until either a Goal state if found or the walk over the search space is Complete.