Re: [computer-go] Search = Bad!

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

> 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.

And like a fractal, there is only an ARTIFICIAL limit on the game of Go,
which is the size of the board.

Go is 100% a fractal and the game has nothing to do with territory,
capturing, Ko etc. It is 100% a case of navigating fractal space.

A solution that navigates the fractal space of Go can safely ignore all
"higher" concepts of the game because they will follow automatically from
implementing the "lower" solution.

You are still thinking in concepts of search and especially pruning the
search tree.

I am thinking in terms of understanding the regularity of the Go fractal
space and navigating by taking a bearing by being able to see the regularity
from above and/or understanding where you are and where you want to go in
fractal space by alternative means, taking advantage of the fact that Go is
a fractal and not some chaotic system.

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