4 ms·

More like "Quantum version of Euler’s 243-Year-Old ‘Impossible’ Puzzle Gets a Solution". This is like saying "30 year old proof of the minimum number of moves

by causi 5y ago

More like "Quantum version of Euler’s 243-Year-Old ‘Impossible’ Puzzle Gets a Solution". This is like saying "30 year old proof of the minimum number of moves to solve a Rubik's Cube gets broken by putting multiple colors on each cubelet face"

maxwell86 5y ago
More like "by painting the whole Rubik's cube with the same color". This new amazing algorithm to this previously thought impossible problem is now able to solve it in 0 moves! And no matter which move, it always gets a solution! The quantum hype train says chooo choooo
- ngcc_hk 5y ago
  Good way of thinking about it
- freemint 5y ago
  This would violate the color sum constraint though, that the integral over the cube area of each colour must be equal.
  - jdmichal 5y ago
    If there's only one color, then that constraint is trivially met.
xxs 5y ago
>30 year old proof of the minimum number of moves Isn't it maximum numbers of moves to solve?
- xmprt 5y ago
  Maximum number of moves to solve any configuration. Minimum number of moves to solve for a given configuration.
  - xxs 5y ago
    exactly what I meant - to solve any configuration.
- Taek 5y ago
  its the smallest number that tells you how many moves are required to solve a rubiks cube, regardless of how that cube was scrambled. lower is better, so its a minimum.
deleted 5y ago
[deleted]