Can Mathematics Improve Strategy in the Game of Go?

[Tenshou]

There is a book out there called Mathematics and Go (or the other way around, I am not sure). This book talks about an ancient game called Go (or in Chinese 围棋*wéiqì*） and the application of math to it, I think it can be done better since it does deal with surreal numbers and those do not really make sense to me. What I am trying to get at is, knowing that it is just graphical constructions(of networks) how do you find the weak points in the network? Is it possible to find such weakness in them? I believe things like this can make or break algorithmic efficiency, also to add insult to injury I head that there is no computer program on this planet that can be a 9p. Hope that will change. So, does anyone know anything about Graph Theory, Network Deficiencies(How to find defects in Graphical construction), and are you willing to lead me towards resources in which I, myself, can find how these works. So much please and thanks :)

 

[fresh_42]

There certainly is such an algorithm:
https://en.wikipedia.org/wiki/AlphaGo