Use different parts of the search tree, if moves have the same circular pattern match

[dsmic]

I read some short remarks of other programs implementing something like this.

The idea is: we have calculated e.g. the state of a seperated group in one part of the search tree. The whole calculation is useless if we do another first move e.g.

If two moves match with the circular pattern (and position and color of cause) but at different positions in the search tree, much of the search information might be of use in both nodes.

I will start thinking about a way of implementing this in a flexible way, which should allow weighting the results from different parts of the search tree.

Any ideas welcome!

I posted this mainly to inform you, just in case you wanted to work on the same idea:)