From 1215648b1ba3c592bd9d97b871349673d1702e44 Mon Sep 17 00:00:00 2001 From: Sebastiano Tronto Date: Mon, 13 Dec 2021 20:40:18 +0100 Subject: Faster optimal solver. This is a pretty big one, but unfortunately performance only improved by about 5%. I implemented one of the main ideas of nxopt, that is switching to the inverse scramble on the fly if it gives a lower branching factor. On the one hand it makes sense that it does not have such a huge impact, since it only rarely happens that we do have a lower branching factor on inverse, but on the other hand I am quite sad that the improvement is barely noticeable :-( Maybe the problem is that I have introduced a lot of new overhead and I can improve that in the future. Or maybe I am just overlooking something stupid. --- src/alg.h | 2 ++ 1 file changed, 2 insertions(+) (limited to 'src/alg.h') diff --git a/src/alg.h b/src/alg.h index 98900b4..f45b682 100644 --- a/src/alg.h +++ b/src/alg.h @@ -30,6 +30,8 @@ AlgList * new_alglist(); Alg * on_inverse(Alg *alg); void print_alg(Alg *alg, bool l); void print_alglist(AlgList *al, bool l); +void swapmove(Move *m1, Move *m2); +void unniss(Alg *alg); #endif -- cgit v1.3