New answers tagged

1

Example: Code snippet for the algorithm (Python 3.6+):


1

Lets say we just have $n$ boxes: $a_1,a_2,a_3,a_4,a_5 ......a_n$ I suppose we know values of each $a_x$ but we don't know "which is which" even when we guess any number in it. First take lowest value, lets say we have values $v_1,v_2,v_3,v_4,v_5 ......v_n$ and lowest value for this moment is $v_{x1}$, second lowest is $v_{x2}$ and so on. We were also given ...


8

For a scramble to be any good, at the very least you would want every pair of adjacent pieces to become separated at least once during the scramble. You don't want any blocks to remain unscrambled, because that would make it slightly too easy. Here is a very rough calculation of how many moves this takes. There are $48$ pairs of adjacent pieces ($6$ cutting ...


Top 50 recent answers are included