We introduce a new framework for solving an important class of computational problems involving finite permutation groups, which includes calculating set stabilisers, intersections subgroups, and isomorphisms combinatorial structures. Our techniques are inspired by generalise ‘partition backtrack’, is the current state-of-the-art algorithm introduced Jeffrey Leon in 1991. But, instead ordered p...