|
|
|
|
|
by fph
655 days ago
|
|
Wouldn't it make more sense to compute a single number of operations that is sufficient to obtain any possible order, for any number of cards in your library smaller than 60? In this way one would have to memorize just a single number and not the whole table. |
|
I'd do it for 98 cards though so you could apply the number in (c)EDH where you're likely to actually see this combo happen though. It would still be valid because if you can sort your library to an arbitrary state S in N moves you can sort it to a state S' that could result in S in any number of moves greater than N as well.