title: Algorithm for finding all combinations of k elements from stack of n "randomly"
body: <p>I have a problem resembling the one described here:</p>
  
  <p><a href="https://stackoverflow.com/questions/127704/algorithm-to-return-all-combinations-of-k-elements-from-n">Algorithm to return all combinations of k elements from n</a></p>
  
  <p>I am looking for something similar that covers all possible combinations of k from n. However, I need a subset to vary a lot from the one drawn previously. For example, if I were to draw a subset of 3 elements from a set of 8, the following algorithm wouldn't be useful to me since every subset is very similar to the one previously drawn:</p>
  
  <p>11100000,
  11010000,
  10110000,
  01110000,
  ...</p>
  
  <p>I am looking for an algorithm thats picks the subsets in a more "random" looking fashion, ie. where the majority of elements in one subset is not reused in the next:</p>
  
  <p>11100000,
  00010011,
  00101100,
  ...</p>
  
  <p>Does anyone know of such an algorithm?</p>
  
  <p>I hope my question made sence and that someone can help me out =)</p>
  
  <p>Kind regards,</p>
  
  <p>Christian</p>