elijahmipt
Member
We have created a megaminx solving robot.
It rotates all 12 faces independently, in contrast to the previous robots. Average move number for a solution is just below 80. The algorithm used is called Beam Search (which is a variation of BFS with a heuristic like in A*, but here the heuristic is a trained neural network). Solution is calculated on a computer with powerful GPU in about 10 seconds.
This record is for the mechanical solution only, but these things can be relatively trivially done in parallel.This attempt was registered in Russian Book of Records (scroll down for English version) https://www.interrecord.ru/naimenshee...During the attempts WCA scrambles were used. Robot does not use any cameras, the state of the puzzle is kept in the memory, and the solving algorithm finds a path that is significantly shorter than the scrambling sequence.
It rotates all 12 faces independently, in contrast to the previous robots. Average move number for a solution is just below 80. The algorithm used is called Beam Search (which is a variation of BFS with a heuristic like in A*, but here the heuristic is a trained neural network). Solution is calculated on a computer with powerful GPU in about 10 seconds.
This record is for the mechanical solution only, but these things can be relatively trivially done in parallel.This attempt was registered in Russian Book of Records (scroll down for English version) https://www.interrecord.ru/naimenshee...During the attempts WCA scrambles were used. Robot does not use any cameras, the state of the puzzle is kept in the memory, and the solving algorithm finds a path that is significantly shorter than the scrambling sequence.
