title: How to shorten the code with recursion approach (or by using something else)?
body: <p>The code is supposed to create win condition for the game.
  Imagine an array with 64 numbers: (0...63).
  The code cuts this array every 4 numbers and then shuffles them: (0,1,2,3)=&gt;(1,0,3,2) etc.
  The main part is the loop through those numbers:</p>
  <ul>
  <li>we pick the first number from the first set and move on (in the example it was 1) and push it to our win condition array (finale array);</li>
  <li>on the second randomized set (5,4,7,6) we also pick the first number, but we supposed to check if this number is not in the same iteration as the one before (so, 0 is 1st, 1 is 2nd etc.; 4 is 1st, 5 is 2nd etc.). The number 5 is in the same place, so we supposed to pick next number in the array, which is 4 in this example. 4 fits the condition, so we move on;</li>
  <li>we have the third set (8,9,11,10), where we repeat the previous action to check if the position of the element in this set is the same as in the previous sets! 8 is 1st and 4 is 1st, so we change it to the next number - 9. But here is the complication - we are supposed to check with the first set as well. 9 is 2nd and 1 is 2nd, so we move to the next number, which is 11;</li>
  <li>on the last iteration of sets we repeat all the above procedures by checking every number of the previous sets with the one in our array. We pick 15 from (12,15,13,14) on the second try;</li>
  <li>we start again every 16 numbers.</li>
  </ul>
  <p>The finale array will be something like this (1,4,11,15,16,...,61) with 16 numbers in it.</p>
  <p>I already wrote the needed code that works just fine, but I want it to be smarter and shorter.
  I do understand that the answer requiers a recursion approach, yet I have no idea how to use it.</p>
  <p>Here is the code itself:</p>
  <pre><code>let currDiff = 4;
  
  function createWinCond() {
  let numb = []
  let winNum = []
  winCond = []
  for (let i = 0; i &lt; currDiff * currDiff * currDiff; i++) {
      numb.push(i) //array with numbers from 0 to 63
      if (numb.length % currDiff == 0) {
          winNum = shuffle(numb) // I have a function that shuffles those numbers
          for (let j = 0; j &lt; currDiff; j++) {
              if (winCond[j] == undefined || winCond.length % currDiff == 0) {
                  winCond.push(winNum[j]);
                  break;
              }
              if ((winCond.length + currDiff) % currDiff == 1 &amp;&amp; winCond[winCond.length - 1] != (winNum[j] - currDiff)) {
                  winCond.push(winNum[j]);
                  break;
              }
              if ((winCond.length + currDiff) % currDiff == 2 &amp;&amp; winCond[winCond.length - 1] != (winNum[j] - currDiff) &amp;&amp; winCond[winCond.length - 2] != (winNum[j] - currDiff * 2)) {
                  winCond.push(winNum[j]);
                  break;
              }
              if ((winCond.length + currDiff) % currDiff == 3 &amp;&amp; winCond[winCond.length - 1] != (winNum[j] - currDiff) &amp;&amp; winCond[winCond.length - 2] != (winNum[j] - currDiff * 2) &amp;&amp; winCond[winCond.length - 3] != (winNum[j] - currDiff * 3)) {
                  winCond.push(winNum[j]);
                  break;
              }                
          }
          numb = [];
          winNum = [];
      }
  }
  </code></pre>
  <p>If you have any idea how this could be written better, please, let me know.</p>