Re: computer-go: perfect play

[Tapani Raiko <praiko@xxxxxxxxx>]

> "Knowledge of the full game tree" does not necessarily involve having all of
> it available at any time. Should the search be depth first, one could stop
> when finding a winning move, yes. But the point is that one has to be
> prepared to search the whole tree anyway, because there might not be any
> winning move at all.

You are about to re-invent A-B-cut. 

And you don't need any fancy evaluation function, you only need to
evaluate end positions.

Wouldn't godevil agaist godevil -match be just like gogod against gogod?
If the other player doesn't have any weaknesses, how could you exploit
them? Of course godevil would choose an optimal move with most
"interesting" (= hard to analyze) outcomes.

-- 
 Tapani Raiko, <tapani.raiko@xxxxxxxxxxxxxxxxx>, 050 5225 750,
 http://www.hut.fi/u/praiko