Optimized number of permutations of mappings in heurisch()

Reduced the number of permutations of mapping by not generating cases where mapping[-1] != x
While earlier the number of terms or components of a function being permuted were (say) n after these changes they have reduced to n-1, thus improving the time complexity

renamed store_tuple to unnecessary_permutations