Classical search and hill-climbing and genetics, implemented in Python All of these algorithm are implemented in both tree and graph form : BFS, DFS, depth limited search, uniform cost search, iterative deepening DFS, greedy best-first search, A*, Hill climbing and after all there are lots of hill climbings here : Stochastic Hill climbing, first-choice hill climbing, random restart hill climbing, simulated annealing, genetics.