Chen Shuang

Well, it's a simple technique to reduce the number of nodes accessed. For example, we start at a position S whose pruning value is no more than maxl, otherwise, S...

Yes, it means the pairs of edges have to be in different orbits. However, in this implementation, I do not filter or pruning edge states during phase 2 search. Instead,...

Well, for 3x3x3 cube, the equivalence of state A and state B is defined as A = S^-1 * B * S (as introduced in http://kociemba.org/math/symmetries.htm) For 4x4x4 cube, the...

OK. I'll check the assumption in about 2 weeks. BTW, the solution of pyraminx does not include tips, which means that the length might larger than "MIN_SCRAMBLE_LENGTH" or "EXACT_SCRAMBLE_LENGTH".

The length includes tips. The filtering is correct.

There isn't any technical difficulty here, the question is where should I show the solution, the bluetooth tool?

There is indeed a contradiction between scrambling efficiency and revealing the optimal solution. At present, the most appropriate approach I can think of is to limit the shortest scrambling length.

Is there any suggestion where to show the result?

Great idea!

Here is a simple implementation of your idea, https://github.com/cs0x7f/cstimer/commit/ab9d2e975a65c7f91f7c315f9ade6f63fdf226cb I will try to improve it in the next few days.