Binary Permutations

[4766667]

Hello everyone,

I'm new with prolog and I don't have any clue about it. Does someone know how to write binary permutations with a const number of 1? For example all 9 bit words with 5 ones. I would be thankful for all help.

 

[nn987]

hi

perhaps you need random sequences of the same word

 

[nn987]

what you need is a predicate of shuffle. there are many

 

[nn987]

this solution is something incompleted

permutation([ ],[ ]).
permutation( [X | L] , P )ermutation(L,L1),add (X, L1, [ L1 | P ]).


ermutation([0,1,1,0,1,1,1,0],L).