Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]

Groups > comp.games.development.programming.algorithms > #36

Shuffling

Show all headers | View raw

For playing cards there are riffle shuffling etc. 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. I like thus to pose
a general question as follows:

Given a list of n different elements, could one find a shuffling
(permutation) operation on them which can be characterized by the
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?

I have done some small amount of experiments but I don't think
to have yet found a really optimal permutation operation.

Thanks in advance.

M. K. Shen

Back to comp.games.development.programming.algorithms | Previous | Next — Next in thread | Find similar

Thread

Shuffling Mok-Kong Shen <mok-kong.shen@t-online.de> - 2012-07-30 12:52 +0200
  Re: Shuffling Mok-Kong Shen <mok-kong.shen@t-online.de> - 2012-08-01 20:14 +0200
  Re: Shuffling hexxial <hexxial@gmail.com> - 2013-01-20 22:58 +0000

csiph-web