search

thewca / tnoodle-lib

scrambling code portion of TNoodle
GNU General Public License v3.0
40 stars 15 forks source link

Add optimal solver in WCA metric #3

Closed cs0x7f closed 4 years ago

cs0x7f commented 4 years ago

Since (x, y) is counted as a single move in WCA metric, the number of states that can be solved in 11 moves is much larger than that in face turn metric. Similarly, the search space is also much larger than that in face turn metric at specific move limit.

On my laptop, the average solving time spent for checking 11-move solvability is about 10ms for a random state. However, for specific states (e.g. 15-move scrambled state), it might take several seconds to do the verification.

gregorbg commented 4 years ago

Wow, this was super-quick! Thank you so much for your help :)