[computer-go] Stages of the game

["Robin Kramer" <robin@xxxxxxxx>]

Hi,

I know code talks most on this list, so I am hoping not to annoy anyone
with my plans, by the way does anyone know of sgf code out there?

1)I wonder at what point in the game would go be feasible to solve by a
depth first search with alpha beta pruning.  If assuming that there are
between 200 and 300 moves per game, while in the opening the search space
is worst case 361!, with each move this search space becomes significantly
smaller given live groups and territory.  Is it not possible to know how
many nodes it is possible to expand per unit time, and how many playable
moves there are left.  I have been reading a book on Fuseki(the equivalent
of full board openings) the statement in the book, is that Fuseki is the
only part of Go which is only place where there is continuos development,
and that Professional players spend most of their time on the first fifty
moves the rest of the game is routine.

2)Second, I have been contemplating, is it better to have a decsion tree
or neural net for each move of the game, or is it better to have a
decision tree or neural net for the entire game.

Sincerely,

Robin Kramer


_______________________________________________
computer-go mailing list
computer-go@xxxxxxxxxxxxxxxxx
http://computer-go.org/mailman/listinfo/computer-go