The results in this thesis on methodology performance are analogous to the associated results in search theory. All three search algorithms are complete for a static search space. The differences appear when the search space is dynamic. A breadth-first search algorithm may miss a solution. Both a depth-first search algorithm and a best-first search algorithm will find a solution in a dynamic search space. In some cases, the best-first search algorithm will find a solution in less than or equal time to the other two methodologies. The worst case performance of all three search algorithms are the same. On average, the breath-first search algorithm will find a solution in O(N). On average, the depth-first search algorithm will find a solution in O(N). On average, the best-first search algorithm will find a solution is an order-of-magnitude less than N.