Algorithm for solving the problem in the game of GO

Hi. Go is a board game played between two players that are black and white alternatively. Players take turns by placing their stones. When a stone or stones are completely surrounded, it is captured and removed from the board. An important problem that arises repeatedly in the game of go is to determine whether a group of stones is alive or not ( which means it is impossible to kill) or dead (which means that there are sequences of moves which will succeeds in capturing it). The major part of the software that is left is developing the Algorithm which solves the life and death problem. In this software application, a user will enter any life and death problem by placing the stones on the board. After the user enters the life and death problem, then the problem is solved by playing the game from that instant. I have already implemented the following: 1. Graphical User interface. 2. Capturing of stones. [login to view URL] move recognition which includes the KO rule, suicide rule also implemented. 4. Go Text protocol (GTP) implemented. The left over part of the software application is Developing the Game engine that solves the life and death problem. This involves search algorithms. As board game softwares make use of the tree algorithms. In this Game engine ALPHA BETA tree search algorithm is to be used. Files have been attached to give you a complete understanding of what is required. The files are: The Graphical User interface which is to be used can be found on [login to view URL], because the file is too big to be attached. A file which describes the Software required.