We propose the addition of the following functions to search.py:
- best_first_tree_search
- uniform_cost_tree_search
- astar_tree_search+
Our background and motivation
Me (Marcelo Jacinto), João Silva and David Souto are 3 students from Electrical and Computer Engineering at Instituto Superior Técnico (Lisbon) that are taking a course on AI. We were solving a search problem whose structure is a tree and not a graph. We are required to use aima-python for the project (in order focus only on the logic side of the problem), but we figured out (using cProfiler) that using the a_star_search implementation for aima-python is much slower than our costume one - because it is currently implemented for graphs in general and its making checks in order to avoid loops (which in trees are impossible to occur).
In our simple problem we checked that the eq function was already consuming about 11s of the total of 30s the problem takes to be solved using aima-python current implementation.
We propose the addition of the following functions to search.py:
Our background and motivation
Me (Marcelo Jacinto), João Silva and David Souto are 3 students from Electrical and Computer Engineering at Instituto Superior Técnico (Lisbon) that are taking a course on AI. We were solving a search problem whose structure is a tree and not a graph. We are required to use aima-python for the project (in order focus only on the logic side of the problem), but we figured out (using cProfiler) that using the a_star_search implementation for aima-python is much slower than our costume one - because it is currently implemented for graphs in general and its making checks in order to avoid loops (which in trees are impossible to occur).
In our simple problem we checked that the eq function was already consuming about 11s of the total of 30s the problem takes to be solved using aima-python current implementation.