I was playing around with the encounter's scenarios, and taking into account the restrictions for a scenario to be solvable there should only be 126 possible combinations. I saw PR #6 saying that having a lookup table for the solution could be the simpler approach so that's what I did.
The steps are different cause I used a different algorithm but they arrive at the same solution with the same number of swaps, so at the very least this table could work as testing data. If your algorithm produces the correct solution for all of these cases then we know it shouldn't have bugs for any possible in-game scenario.
I was playing around with the encounter's scenarios, and taking into account the restrictions for a scenario to be solvable there should only be 126 possible combinations. I saw PR #6 saying that having a lookup table for the solution could be the simpler approach so that's what I did.
The steps are different cause I used a different algorithm but they arrive at the same solution with the same number of swaps, so at the very least this table could work as testing data. If your algorithm produces the correct solution for all of these cases then we know it shouldn't have bugs for any possible in-game scenario.
Here's the algorithm to generate the possible scenarios and solve them https://github.com/alexis-matuk/verity-solver/tree/master