A basic search without domain information BreadthFirst search algorithm (https://en.wikipedia.org/wiki/Breadth-first_search) to search the solution for a initial state provided. The initial state of the problem must be provided and as result the algorithm returns the list of solution action (if the problem as solution) and a basic statistics about the nodes explored, duplicate nodes and the maximum depth explored.
A basic search without domain information Depth search algorithm (https://en.wikipedia.org/wiki/Depth-first_search) to search the solution for a initial state provided. The initial state of the problem must be provided and as result the algorithm returns the list of solution action (if the problem as solution) and a basic statistics about the nodes explored, duplicate nodes and the maximum depth explored.
A basic search without domain information Iterative Depth search algorithm (https://en.wikipedia.org/wiki/Iterative_deepening_depth-first_search) to search the solution for a initial state provided. For each iteration, the depth in the search is incremented in 1 level. The initial state of the problem must be provided and as result the algorithm returns the list of solution action (if the problem as solution) and a basic statistics about the nodes explored, duplicate nodes and the maximum depth explored.
SearchAstar implement an Astar algorithm (https://en.wikipedia.org/wiki/A*_search_algorithm) to search a solution state for a problem. The State must implement also the Heuristic interface. The initial state of the problem must be provided and as result the algorithm returns the list of solution action (if the problem as solution) and a basic statistics about the nodes explored, duplicate nodes and the maximum depth explored.