So I am making some progress on my Go AI. I am interested in taking a mathematical/board solving approach rather than using Monte Carlo or other similar methods that play out the board. Most similar to what I am doing that I have found is the Benson Algorithm.

http://en.wikipedia.org/wiki/Benson%27s_algorithm_(Go)

Are there algorithms for other aspects of the early game? I know about the 'Mathematical Go' for endgame but that is very different. I have come up with several generalized functions similar to Benson's that seem promising and would love to know what is out there already!