Remix.run Logo
Show HN: Rubiks Cube Solver(speedcube.com.br)
18 points by wozzp 9 hours ago | 8 comments

Speedcube is an open-source platform for speedcubers featuring a Rubik's Cube solver, competition timer, algorithm library, and AI-assisted cube recognition directly in the browser.

Built with React, TypeScript, Rust, and Python, the project aims to become an all-in-one platform for cubers—from beginners to competitive solvers.

http://github.com/williamisnotdefined/rubiks-cube-solver/

agar 7 hours ago | parent | next [-]

Note to the site author: Using Chrome's translate tool seems to break your UI. Upon first visit, I was prompted to translate from Portuguese to English and accepted. Subsequent visits required I click the "Translate this page" button on the right side of the URL bar. (Edit: Chrome 1490.7827.201 on Windows 10).

When translated, clicking the Solver drop-down (default 3x3x3) displays:

Unexpected error

Something went wrong. The current screen broke unexpectedly. Please try again or switch routes to reload it.

wozzp 5 hours ago | parent [-]

Interesting, but the site has support for 9 languages, what language were you using?

vivzkestrel 3 hours ago | parent | prev | next [-]

- instead of giving a solver, solve the harder problem

- make a tool that teaches me how to visualize a rubiks cube so that i can solve it myself

- make it something like this https://visualrambling.space/neural-network/

schoen 7 hours ago | parent | prev | next [-]

Does it effectively achieve God's Algorithm (minimum theoretically possible sequence of moves to solve each position)?

xmprt 6 hours ago | parent | next [-]

God's algorithm is not computationally feasible on consumer hardware so I'd assume not although there are many algorithms that can get pretty close (either matching or 1-2 moves off the optimal solution) which are much faster to solve. If you're curious, look up Cube Explorer which is an app that's built for this.

wozzp 5 hours ago | parent | prev [-]

Not in practice. Computing the absolute minimum solution for every possible position is computationally infeasible for a web-based solver. This uses Kociemba’s two-phase algorithm instead, which produces very efficient solutions, usually close to optimal, without requiring enormous amounts of time and memory.

logicalappeals 7 hours ago | parent | prev [-]

HN hitting new lows when slop like this makes it on my feed. This is neither original nor inspiring. Props on the umpteenth Rubik’s cube solver, I guess.

wozzp 5 hours ago | parent [-]

Your -3 karma is pretty self-explanatory. Hope you have a better day tomorrow.