Recent content by qq280833822

Updates after 2025.08.18 Timer 1. When a Bluetooth timer is connected, the spacebar can now also be used to start WCA inspection. Scramble 2. Add random-state scramble for Megaminx (generation may take a few seconds), add S2L scramble for Megaminx, and improve the Megaminx solver. 3. Add "Easy"...

I've collected some sota solvers here: https://github.com/cs0x7f/cube_solver_test (note that some solvers don't support multi-thread solving on a single state, so this is for reference only). With a solver using 2GB of memory, the solving time for finding a single optimal solution in HTM for a...

I deployed a webassembly demo of cube48opt series on https://cstimer.net/cubeopt/ Currently, its function is to take a set of scrambles (manually input or randomly generated) as input and then find their optimal solutions respectively. Before solving, it needs to take some time to generate a...

The current average solution length should be between 90 and 95. In the use cases of cstimer, the computation time (including initialization) is only a few seconds, so the size of pruning tables and the number of candidate solutions at each stage is very small.

I implemented a similar method as your master's thesis myself. You can set the scramble type to "Megaminx->random state" in the beta version ( https://cstimer.net/new/ ).

Although I don't know if anyone will actually use it, I tried integrating megaminx random-state scramble into cstimer.

Updates after 2024.12.01 Timer 1. You can now set which keys stop the timer (any key/spacebar + letter/spacebar only). 2. A "tick" will be played when recording a split time for multi-phase timing. 3. The timer can be started by pressing both left and right Ctrl/Alt/Shift keys on the keyboard...

There were more than 400 million solves on csTimer last year.

I see. I missed the difference between throughput and latency in the previous discussion. Throughput refers to the overall efficiency of solving a set of cubes when I have enough cubes (for example, 1,000) to solve. Latency refers to how long I have to wait to get a solution when I only have one...

I think we should first reach a consensus that the speed of the solver is closely related to the size of the pruning table (that is, the memory usage). Generally speaking, if the size of the pruning table is doubled, the search time can be halved. Therefore, it is meaningless to compare two...

Yes, it was my typo.

Here, it refers to the probability of all canonical sequences in the sense of equal probability. Taking the number of moves = 2 as an example, among all 243 canonical sequences, 135 start with URF (because we stipulate that D U is not allowed to appear). Randomly sampling in this probability...

What I mean is to calculate the probability of each move at each sampling step, which includes the following steps. 1. First, calculate the number of canonical sequences of length N start with specific face, which are divided into U/R/F and D/L/B according to symmetry. For U/R/F, this sequence...

First of all, as with your premise, we can agree that U must precede D in a canonical sequence. In this way, for any given prefix sequence and total length N, the number of canonical sequences can be accurately calculated in O(N) time using recursive algorithms (or dynamic programming). Then for...

I think a random-state sampling of a state with specific optimal-solution length (<=16) can be achieved in the following way. 1. Randomly generate a canonical sequence of length N and get a state. 2. Use a solver to calculate **all** canonical sequence solutions. If the optimal solution length...