Search All of the Math Forum:
Views expressed in these public forums are not endorsed by
Drexel University or The Math Forum.
|
|
|
|
Card shuffling
Posted:
Jul 30, 2012 2:59 PM
|
|
For playing cards there are riffle shuffling etc., see e.g.
http://mathworld.wolfram.com/RiffleShuffle.html With computers
one is not dependent on constraints resulting from manual working
and consequently could specify more complex operations that may be
rather inconvenient to be performed manually with cards. I like to
pose a general question:
Given a list of n different elements, could one find a permutation
operation on them which can be characterized by the (variable)
numerical value of one single parameter (corresponding essentially
to the cutting point of a card deck into two parts in manual
shuffling) and which is likely to lead to the highest degree of
derangement (disorder) of the original list?
Thanks in advance.
M. K. Shen
|
|
|
|
