I have 4 points and their respective positions, i want to be able to calculate each potential combination of swaps i can make with those points. so the first part would be something like thisvertexamount = 4 swaparr = #()for i=1 to vertexamount do( for i2=1 to vertexamount do ( if finditem swaparr [i,i2] == 0 and finditem…
Why not use permutations here? You would get all the unique point configurations (of course with growing number of points it won't be as useful as the number of arrangements here is N factorial): fn permutations elems =( if elems.count == 1 then #(elems) else ( local result = #() for elem in elems do ( local rest = for e…