Re: Pattern learning: update

[Henrik Rydberg <rydberg@xxxxxxxxxxxxxx>]

Antii,

Thanks! And yes, your second item is more right-on.
I did not realize the real-valued nature of that operation
until after I sent the reply.

Your algorithm has a lot of potential, I think. Now you're
using it to pick patterns from real games. What if one were
to construct lots and lots of small random situations, in a
way that they can be played, locally and using exhaustive search,
to the "end" somehow. Then one could create patterns automatically.

Here's a first try on a useful definition of a 'local game'.

* Define a local area of the board by an arbitrary closed boundary.
* Define the boundary points as either empty,black,white, or limbo.
* Assume all boundary stones to be alive and kicking.
* Solve the inner problem as in Tsume-Go (David Dyer, do you
  have a comment on this?)
* Match the outcome using Huima's algorithm.

Of course, the assumption "alive and kicking" is crucial and wrong,
but hey, this is only a construct in order to produce move
*suggestions*, so it might be ok.

Henrik

-- 
Henrik Rydberg (http://fy.chalmers.se/~rydberg),
Department of Applied Physics, Chalmers University of Technology.