That Shamir's algorithm is correct was never in question.
244 karma · joined May 15, 2022
That Shamir's algorithm is correct was never in question.
You can see that in the example in the end, a random cube resulted in a 20 move solution, which is the upper bound for any solution [0]. There are not many cube configurations that require such a long solution and the chance that we hit one randomly (and solved it that quickly) is incredibly small.
In order to make this algorithm optimal, you'd need to do iterative deepening, trying to find solutions of length 1, 2, etc. up until 20.
https://en.m.wikipedia.org/wiki/Kurt_von_Hammerstein-Equord#...
?
From 2016 - "The university is mired in debt amounting to nearly NIS 13 billion ($3.4 billion) over employees’ pensions."