Superpermutation for 3 symbols (difficulty: medium)

Superpermutation for 3 symbols, encoded as QUBO. The goal is to find a string of length 9 (known to be minimal length) that contains as substrings every permutation of {1,2,3}. The QUBO encodes the number of permutations covered, with changed sign, therefore the optimal value is -6.

https://en.wikipedia.org/wiki/Superpermutation

Download QUBO Explanation of the file format

You must log in or register to submit a solution.

Best Scores



(c)2024-2025 Fraunhofer FOKUS. All rights reserved. Funded through the BMWK EniQma and PlanQK projects. Imprint   Data Protection