tseitsei
Veteran
We're definitely going to have arbitrary limits, but if we do filter things beyond 1 move, I'd like to at least have consistent reasoning across puzzles, as opposed to arguments about whether an N-move scramble feels easy or can be solved by a non-cuber or whatever. One possible way is as follows:
- Choose a constant k, much less than 1.
- For a given puzzle, let P be the number of positions.
- Let n be the greatest integer so that the number of positions solvable in at most n moves is no greater than kP.
- If computationally feasible, forbid any positions that are solvable in at most n moves.
For instance, if we let k = 1/1000, we forbid the following: 2x2x2 positions solvable in <=4 moves; Pyraminx positions solvable in <=3 moves (or <=5 moves if you include tips); Skewb positions solvable in <=4 moves; Square-1 positions solvable in <=6 twists; 3x3x3 positions solvable in <=14 moves. Unless I made a mistake, of course.
I think that if we are gonna do scramble filtering (which I don't really want) then something like this is the correct way of doing it.
Not just throwing some random numbers out of nowhere to different puzzles...