• Welcome to SpeedSolving.com — the world’s largest puzzle community!

    You’re currently browsing as a guest, which means you have limited access to discussions, resources, member profiles, and community features.

    Join 50,000+ cubers and puzzle enthusiasts from around the world to ask questions, share solves, improve faster, and be part of the community.

    Registration is free, fast, and easy — create your account today.

    Already a member? Log in here to hide this message and start participating.

csTimer released

Would it be possible to have alg training functionality using virtual cubes, similar to Tao Yu’s TrainYu site? This would be particularly helpful for Megaminx and 4x4 and bigger NxNs which are not supported by TrainYu.
 
Would it be possible to have alg training functionality using virtual cubes, similar to Tao Yu’s TrainYu site? This would be particularly helpful for Megaminx and 4x4 and bigger NxNs which are not supported by TrainYu.
I'm not quite sure what exactly you want. There are training scrambles, e.g. PLL, OLL, etc. And it's able to filter cases by clicking the gear button next to the scramble selector.
 
I'm not quite sure what exactly you want. There are training scrambles, e.g. PLL, OLL, etc. And it's able to filter cases by clicking the gear button next to the scramble selector.

Basically something like that but for megaminx. It would make learning OLL and PLL a lot easier on a virtual puzzle.
 
I've never used much more than the timer before, but now I played around with the tools a little bit.

I think the solvers for Cross, Cross+F2L and especially Pyaminx V are very cool to find good solutions and learn from them.
 
Last edited:

Basically something like that but for megaminx. It would make learning OLL and PLL a lot easier on a virtual puzzle.
I just implemented megaminx's LL, PLL, LL+LS scramble in the beta version, and added qminx by the way. However, there is currently no way to do case filtering, only random cases.
For convenience, I directly use <R U R', F' U F, U> and calculate the solution of a randomly generated state in the sense of this set of generators, about 20 moves for each scramble. Of course, for virtual megaminx, scrambling is done in one click.
 
If I wanted to generate 10,000 scrambles for a given event, what would be the best way of doing it given csTimer limits at 100 999 at a time?
Edit: csTimer does 999 at a time. I think I can manage with that but a way to generate larger numbers would be ideal.
 
Last edited:
IMG_20230531_192552_HDR.jpgHi @qq280833822 recently my cstimer with all my times saved has stopped showing my averages above the list of times and the little ao5 and ao12 under where you type the times. Now I can no longer see my PB's and current averages. I also can't delete times if I type in the wrong number by accident because when I press on the time nothing pops up. By the way I also can't go into settings for the same reason. I press on it and it doesn't come up. Interesting though when I press on buttons like tools and donate they do pop up. This never happened before to me. If you have any solutions I'd be delighted.
Anthony
 
View attachment 24485Hi @qq280833822 recently my cstimer with all my times saved has stopped showing my averages above the list of times and the little ao5 and ao12 under where you type the times. Now I can no longer see my PB's and current averages. I also can't delete times if I type in the wrong number by accident because when I press on the time nothing pops up. By the way I also can't go into settings for the same reason. I press on it and it doesn't come up. Interesting though when I press on buttons like tools and donate they do pop up. This never happened before to me. If you have any solutions I'd be delighted.
Anthony
It looks like it might be an issue with IE, since Microsoft no longer supports IE, so I haven't tested its compatibility. It is recommended to switch to other browsers, e.g. edge, chrome.
 
How do target times work? I've been using them, and some of the target times are slower than my current averages. Why is that?
For example, there are 5 solves in the time list, which are 12, 8, 15, 9, 9. Then my current ao5 is 10 (which is also the session best).
The next solve I can break the session best of ao5 as long as I get sub12. So the value of the target in the ao5 line is 12, which means that as long as the next solve time is less than this value, I can break the session best of this line.
Similarly, in the above case, the session best of mo3 is 10.67, and in order to break it, the next solve should be sub14.
 
For example, there are 5 solves in the time list, which are 12, 8, 15, 9, 9. Then my current ao5 is 10 (which is also the session best).
The next solve I can break the session best of ao5 as long as I get sub12. So the value of the target in the ao5 line is 12, which means that as long as the next solve time is less than this value, I can break the session best of this line.
Similarly, in the above case, the session best of mo3 is 10.67, and in order to break it, the next solve should be sub14.
Oh, so it's just a singular time, not an average time... I have to beat the time that is given to actually be able to proceed with a faster average. Is that right?
 
I just implemented megaminx's LL, PLL, LL+LS scramble in the beta version, and added qminx by the way. However, there is currently no way to do case filtering, only random cases.
For convenience, I directly use <R U R', F' U F, U> and calculate the solution of a randomly generated state in the sense of this set of generators, about 20 moves for each scramble. Of course, for virtual megaminx, scrambling is done in one click.
Is it possible to add 2x2 pyraminx (shapeshifter) or fisher cube?
 
Back
Top