# Fast solver for arbitrary target groups

Submitted by mdlazreg on Thu, 11/12/2009 - 09:06.

As you know one of the breakthrough of cube computing is Silviu's successful depth calculation of all symmetrical positions. This breakthrough used a two phase algorithm that has the symmetrical positions as its target group. Regular solvers will simply stop once they hit the position they want to solve but Silviu's idea is to never stop until all positions in the target group are hit... This way of solving is very fast and it is what Rokiki has used to calculate the "group that fixes the edges".

My question is can this be applied to arbitrary target groups whose elements share something in common? for example let's say my target group is some conjugacy class of the cube. How can I calculate the depth of each element in this conjugacy class using Silviu's idea?

My question is can this be applied to arbitrary target groups whose elements share something in common? for example let's say my target group is some conjugacy class of the cube. How can I calculate the depth of each element in this conjugacy class using Silviu's idea?