Search for transitive connections

We present an algorithm that detects non transitive connections in the game of Go. An optimized Alpha-Beta search is used on top of two Generalized Threats Searches, one for each of the two connections. It deals with full board situations such as the ones encountered in real games. Our program is able to solve problems such as the double monkey jump or the double keima on the second line. Even if the results are not theoretically perfect, they are pretty reliable given the results on a test suite.