Re: Split searches

[Blue Thunder Somogyi <blue@xxxxxxxxxxx>]

Heikki Levanto wrote:
> 
>  Hi All,
> 
>  Some time ago someone here mentioned that one of the greatest problems for
>  computer go is to be able to separate two local problems so that they can be
>  solved locally. I have thought about the matter, and here is what I have
>  come up with. So far it is only speculation, I haven't tried to code
>  anything yet...
 (much deleted...)
>  Any comments? Is this well known theory I happened to rediscover, or a well
>  known dead end? Or perhaps something useful??
> 
>  - Heikki
> 
> 
> --
> Heikki Levanto  LSD - Levanto Software Development   <heikki@xxxxxxxxxxxxxxxxx>

This all sounds like a sound approach, however, wouldn't a good third
step (or maybe fourth, depending on how you see it) be to try to
superimpose the solutions from the two independent analysis that
overlap, trying to determine if there is a single, synergetic solution
to both problems.  This seems to me to be a good method of taking any
complex problem, breaking it into readily soluble ones, and trying to
determine the set of solutions that yield the most integrated total
approach.  Thoughts?