Use a lookup for the score of a node, rather than recomputing it each time. This has the disadvantage of no ability to include depth in the score, but allows the entire tree to be searched quickly and without much memory usage.