Re: [computer-go] Search = Bad!

[Mark Boon <tesuji@xxxxxxxxx>]

Frank de Groot wrote:

> > Aren't fractals inherantly continuous functions?  And isn't Go an
> > inherantly discrete game?  Not only is Go not a fractal, but there is
> > not even a reasonable analogy there.
> >    
> When you would plot a triangle with a color printer of all possible Go
> games, and every pixel would be a position-result (white when it's a win
> with perfect play for white, black when it's a win with perfect play for
> black, gray when it's undecided yet), you will get a nice-looking, regular
> result, with more and more detail at the edges and increases complexity
> towards the edge like a fractal.
>  
Unfortunately, determining the color of a single point in the picture is 
currently beyond our capability for a large majority of the points. 
You're hoping the picture (or fractal) will give you some relational 
information on how to move from one point in the picture to another 
point in the picture, which magically happens to be the best follow-up 
position of the point where you started?

I would say that if such a relation existed, it would be proof Go was 
designed by a higher intelligence to test our wits :-)

By the way, it seems to me with your color scheme, most early positions 
will all be black.

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