Permutations

Hi,

It would be great if you could share your experience and bring your brainpower to solve this problem.

I would like to generate all permutations of a collection of numbers.

Collection:
0, 1, 2

Permutations:
0, 1, 2
0, 2, 1
1, 0, 2
1, 2, 0
2, 0, 1
2, 1, 0

Is it possible to make without coding? Has anyone tried this? If no, I found examples writen on C#, can anyone help to adapt it to grasshopper?

Replies to This Discussion

Permalink Reply by Blonskiy on November 11, 2015 at 3:46am

http://stackoverflow.com/questions/11208446/generating-permutations...

Here you can see examples.

Permalink Reply by Daniel González Abalde on November 11, 2015 at 4:07am

Brute force algorithm. TT Toolbox has this component.

http://www.food4rhino.com/project/tttoolbox?etx

http://www.grasshopper3d.com/video/tt-toolbox-brute-force-optimization

Permalink Reply by Blonskiy on November 11, 2015 at 5:18am

Gracias, Daniel. It is really imazing tool.

Can you tell me permutations can be solved without iterations using brute force algorithm?

Permalink Reply by Mateusz Zwierzycki on November 11, 2015 at 5:41am

Permalink Reply by Blonskiy on November 11, 2015 at 6:01am

Thank you, Mateusz. It is the perfect solution.

Permalink Reply by Marco Pellegrino on November 17, 2017 at 10:04am

Hi Mateusz...does it make sense also with 6 number?

1,2,3,4,5,6
am I going to get all the possible combination?

Permalink Reply by David Rutten on November 17, 2017 at 12:04pm

Yeah, it's a fully scaleable approach, just keep adding more inputs to the CrossRef components.

Do note that the number of permutation is n!, so 6=720, 7=5040, 8=40320, and it just keeps going up faster and faster.

Permalink Reply by alparslan zafar on January 13, 2019 at 11:15am

even permutation?

Permalink Reply by Ludovic Regnault on May 11, 2018 at 4:58am

Hi,

I have a similar issue but with much more inputs. My goal is to ask galapagos to find the best permutation among the set of all possible permutations.

I would like to have a slider with the amount of possible permutations as genome. The problem is that it will not be possible to compute all the possible permutations and then pick one of them with the slider (this would take to long to compute).

I place in attachment a simplified definition to present the problem, but for information my goal is to place elements with fix various lengths in the best location in a geometric model.

Attachments:

genetic algorithm using permutations.gh, 12 KB

Permalink Reply by jason mike on March 20, 2019 at 9:09am

hacking services

WHO needs money??
need travel VISA??
PAYPAL AND BANK TRANSFER AVAILABLE
flight ticket available all destinations
ATM clone cards ready to ship all country
western union services back in the game
online shopping, ask me how it works
original FAKE or REAL id, dl, pp, skul docs available for all countries.

CONTACT ME NOW AT

watsap @0014242429194
icq @745215892
inbox @cleanhackdeals at gmail dot com

NB: dont waste your time to contact for fb, ig or twitter hack... few serious buyers needed

RSS