Improve order of moves in NISS solutions

Now the side that has more moves is written first.
For example: write (U L F) B instead of B (U L F)

This also fixes the test on appendsolutions, which used an older version
of the function's signature.

1 files changed, 3 insertions, 2 deletions

diff --git a/test/130_appendsolution/appendsolution_tests.c b/test/130_appendsolution/appendsolution_tests.c
index 066c305..abff359 100644
--- a/test/130_appendsolution/appendsolution_tests.c
+++ b/test/130_appendsolution/appendsolution_tests.c
@@ -17,7 +17,8 @@ int64_t readmoves(const char *, size_t n, uint8_t [n]);
 void solution_moves_reset(solution_moves_t [static 1]);
 bool solution_list_init(solution_list_t [static 1], size_t n, char [n]);
 int64_t appendsolution(const solution_moves_t [static 1],
-    const solution_settings_t [static 1], solution_list_t [static 1]);
+    const solution_settings_t [static 1], solution_list_t [static 1], bool,
+    const char *);
 
 void run(void) {
         int i, ntrans;
@@ -49,7 +50,7 @@ void run(void) {
                 settings.tmask |= UINT64_C(1) << (uint64_t)readtrans(str);
         }
 
-        appendsolution(&moves, &settings, &list);
+        appendsolution(&moves, &settings, &list, false, "Test");
 
         printf("%s", list.buf);
         printf("Number of solutions: %" PRIu64 "\n", list.nsols);