A tiny Go Rubik's Cube solver and visualizer.
go run .
Main function currently: scrambles a cube, prints the cube, then solves it with BFS.
Maximum solve depth for an optimal solve is 5 turns, above that is too high for 16GB of ram on windows.
-
Switch to Iterative Deepening A* with heuristic LUT.
-
Implement a way for the user to enter a cube state.
-
Create 3D visualization using raylib or WebGPU.
-
Port code to mobile device.
-
Add scanning ability for both web and mobile app
Currently the LUT for the corners is calculated incorrectly as it throws away shorter routes to nodes and overestimates the distance in the heuristic, which no longer guarantees optimal solution.