Stefan
Legend
It is not as simple as doubling the twist metric table because (x,y) is counted as 1 if one of them is zero and 2 otherwise. So the table would have to be computed from scratch, and from what I've heard, generating the original table took a year (in 2005).
But we can use it for a bound. Ten moves counting all U/D/R-turns corresponds to at most five R-turns, right? So only states reachable with at most five R-turns are filtered out, so at most 1 out of 130316 states.
Also, computers today are much more powerful than in 2005, and if you just want to know the percentage of states filtered out, you don't need the full distribution table.
I'm probably not understanding this problem correctly, but why do 2x2, pyraminx, square-1, and skewb have such a high filter as compared to 3x3. Actually, my real question is why doesn't 3x3 have a higher filter? Isn't the purpose to not let extremely easy (2 moves away) cases happen? Why is 3x3 allowed 2 moves, but other puzzles are not?
I believe 2x2, pyraminx, skewb and square-1 get special treatment because there, "too short" solutions have a non-negligible chance of actually happening.
Last edited: