§ Counting permutations with #MAXSAT

Using #MAXSAT, you can count permutations, weird. Build a complete bipartite graph K(n,n), and then connect left to source, right to sink with unit capacity. Each solution to the flow problem is an assignment / permutation.