Re: [computer-go] Search = Bad!

["Frank de Groot" <frank@xxxxxxxxxxxxx>]

From: "Vlad Dumitrescu" <vlad_dumitrescu@xxxxxxxxxxxxxxxxx>

> The game tree is a tree - how would you map it onto a surface so that you
get the fractal
> analogy to work?

As a forest. Like I said, you are in the centre of a forest that expands
enormously and you can move much further sideways than forward.

> Given such a mapped point, how do we find its successors in the
> tree?

The ones adjacent to it. Each point has max. 360 adjacent points.
(of course this can never be expressed in a picture, but it works fine in
your head or as a data structure, but we don't NEED a data structure, we
need to know the regularities and derive a method from them, we don't need
the tree itself when we are playing).

> A question: what do you mean above by "undecided yet"? If this fractal
describes
> the game, then all points are decided...

When a position is neither a win for black, nor for white with perfect play.
So "undecided" in terms of what is possible with perfect play, not in terms
of values in the fractal.

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