I'm trying to create a large algorithm set for cubing, specifically to make every combination of 2, 3, or 4 sets of F2L pairs. My attempts keep falling short, mainly because I can't seem to manage the huge number of combinations effectively. For reference, 2SL has 52^2 combinations, 3SL has 52^3, and 4SL skyrockets to 52^4, which is way too much to handle all at once.
I'm struggling with issues like not getting the output I need, not removing duplicates properly, and managing the sheer volume of sets. I would appreciate any guidance on how to approach this problem or if someone can help me with this project!
4 Answers
I totally get the struggle with combinatorial logic; it can be a nightmare! If you're considering this as a serious project, you might want to look into some algorithm pattern libraries. I've found resources like LeetCodeWizard really useful for organizing complex algorithm builds, and it might help simplify your project too.
What have you tried so far? You can't really load everything into memory at once, especially with that many combinations.
I've tried batching the combinations into files, like saving around 10k cases per file, for example, '2SL_1' to manage the quantity better.
Have you tried explaining your issue without the jargon like 'cubing' or 'F2L pairs'? It might help others understand your problem better. Remember, asking someone to create the whole project for you isn't really the aim of the forum.
That's true! I thought if I used the terms, I'd get better help, but explaining it more simply could be the way to go.
Sharing your code would be super helpful! It's hard to offer advice without seeing what you've written so far.
I mainly copied the F2L cases from speedcubedb and looped through them, but I added a U move alternation between algs to change outcomes.
Thanks for the suggestion! I typically hard code everything, so this could really streamline things for me.