Sakarie
Veteran
This is mainly for threecycling stickers, but could maybe be useful for R2 and M2 too. Also it's mostly for those who uses letters.
This is only an idea, and since I'm not skilled in programming, I have too share it, and ask if any one out there can and want to do it. If you know anyone who's probably capable, but doesn't read the blindforums, please hint them!
One of most important parts of the blindsolve is to as fast as possible know what algorithm to use when you have a pair of letters. What algorithm do I use for corners when I get FR? PF? AL? If I don't have to translate the letters to stickers, and again translate into a commutator, I could gain much time.
My idea would be a letter-generator, that can give me predefined pairs.
The basic would be that the user gives some rules to the program. For my corners it would be "A cannot be followed by B or C" (since they're the same piece), but in some easier form. Then you just take random pairs.
The extra thing you could (Should!) do is to integrate a timer, so that when you press space or something to get the letterpair, you also start a timer, that you should stop when you've solved the threecycle. If you could save those times (the best would be something in the same way as this), you could see statistics over which ones you are best and worst at. Then you could choose to exclude the letters ABCDEFGHIJKL and just do with MNOPQRSTUV, or something.
Perhaps, you can exchange the letter pairs, for your on syllable words or something, but that seems not very necessary.
I actually think this would be a very good way of practising, and you could do it for hours, which most of us couldn't do with just normal blindsolving.
What do you think?
This is only an idea, and since I'm not skilled in programming, I have too share it, and ask if any one out there can and want to do it. If you know anyone who's probably capable, but doesn't read the blindforums, please hint them!
One of most important parts of the blindsolve is to as fast as possible know what algorithm to use when you have a pair of letters. What algorithm do I use for corners when I get FR? PF? AL? If I don't have to translate the letters to stickers, and again translate into a commutator, I could gain much time.
My idea would be a letter-generator, that can give me predefined pairs.
The basic would be that the user gives some rules to the program. For my corners it would be "A cannot be followed by B or C" (since they're the same piece), but in some easier form. Then you just take random pairs.
The extra thing you could (Should!) do is to integrate a timer, so that when you press space or something to get the letterpair, you also start a timer, that you should stop when you've solved the threecycle. If you could save those times (the best would be something in the same way as this), you could see statistics over which ones you are best and worst at. Then you could choose to exclude the letters ABCDEFGHIJKL and just do with MNOPQRSTUV, or something.
Perhaps, you can exchange the letter pairs, for your on syllable words or something, but that seems not very necessary.
I actually think this would be a very good way of practising, and you could do it for hours, which most of us couldn't do with just normal blindsolving.
What do you think?