'storage generic searcher and variants to run the search demosin folder "aipython"load "searchgeneric pyusing ipython - searchgeneric pyand copy and paste the example queries at the bottom of that file this requires python searcher searcher for problem can be asked repeatedly for the next path to solve problemwe can construct searcher object for the problem and then repeatedly ask for the next path using search if there are no more pathsnone is returned searchgeneric py -generic searcherincluding depth-first and from display import displayablevisualize class searcher(displayable)"""returns searcher for problem paths can be found by repeatedly calling search(this does depth-first search unless overridden ""def __init__(selfproblem)"""creates searcher from problem ""self problem problem self initialize_frontier(self num_expanded self add_to_frontier(path(problem start_node())super(__init__( def initialize_frontier(self)self frontier [ def empty_frontier(self)return self frontier =[ def add_to_frontier(self,path)self frontier append(path @visualize def search(self)"""returns (nextpath from the problem' start node to goal node version june