title: Python large permutations
body: <p>I'm working with a list that can range from 10-100 objects. Each object has specific variables assigned to it such as speed, cost, ect. The purpose of this is to find the a specific list out of all the list in the permutation.</p>
  
  <p>The problem I'm running into is generating the permutation of 10 list, takes roughly 30 minutes. When I increase this to 12, 13... or more, the number of list becomes so much that running through each one takes so much time its pointless. What I currently have is the following:</p>
  
  <pre><code>list = [1,2,3,4,5,6,7,8,9,10]
  
  for item in itertools.permutations(list):
     print(item)
  </code></pre>
  
  <p>This works great because it doesn't store the massive permutation list in RAM, but it does take a very long time. This is a shot in the dark, but is there any way I could speed up the process of looping over every list in the permutation?</p>