On then×n×nRubik's Cube
From MaRDI portal
Publication:4558039
Abstract: We describe in details the nxnxn Rubik's Cube, namely a Rubik's Cube with n rotating slices in each face. Then we state and prove the "first law of Cubology", i.e. the solvability criterion, for it
Recommendations
- On some notions of good reduction for endomorphisms of the projective line
- Good reduction of certain covers \(\mathbb{P}^1\to\mathbb{P}^1\)
- A Shafarevich-Faltings theorem for rational functions
- A criterion for potentially good reduction in nonarchimedean dynamics
- Good reduction of periodic points on projective varieties
Cites work
- Algorithms for solving Rubik's cubes
- Black holes as Rubik's cubes
- scientific article; zbMATH DE number 5789115 (Why is no real title available?)
- scientific article; zbMATH DE number 3959324 (Why is no real title available?)
- scientific article; zbMATH DE number 5494046 (Why is no real title available?)
- On God's number(s) for Rubik's slide
- Rubik's Revenge: The Group Theoretical Solution
- The diameter of the Rubik's Cube group is twenty.
- The first law of cubology for the Rubik's Revenge
- The Rubik's cube problem revisited: a statistical thermodynamic approach
- Towards God's Number for Rubik's Cube in the Quarter-Turn Metric
Cited in
(4)
This page was built for publication: On then×n×nRubik's Cube
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4558039)