title: Loop through different sets of unique permutations
body: <p>I'm having a hard time getting started to layout code for this problem.</p>
  
  <p>I have a fixed amount of random numbers, in this case 8 numbers.
  R[] = { 1, 2, 3, 4, 5, 6, 7, 8 };</p>
  
  <p>That are going to be placed in 3 sets of numbers, with the only constraint that each set contain minimum one value, and each value can only be used once. <strong>Edit: all 8 numbers should be used</strong></p>
  
  <p>For example:</p>
  
  <p>R1[] = { 1, 4 }</p>
  
  <p>R2[] = { 2, 8, 5, 6 }</p>
  
  <p>R3[] = { 7, 3 }</p>
  
  <p>I need to loop through all possible combinations of a set R1, R2, R3. Order is not important, so if the above example happened, I don't need</p>
  
  <p>R1[] = { 4, 1 }</p>
  
  <p>R2[] = { 2, 8, 5, 6 }</p>
  
  <p>R3[] = { 7, 3 }</p>
  
  <p>NOR</p>
  
  <p>R1[] = { 2, 8, 5, 6 }</p>
  
  <p>R2[] = { 7, 3 }</p>
  
  <p>R3[] = { 1, 4 }</p>
  
  <p>What is a good method?</p>