| Commit message (Collapse) | Author | Age | Files | Lines |
| |
|
|
|
|
|
|
|
|
|
| |
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.
|
| | |
|
| | |
|
| | |
|
| |
|
|
| |
multithreading.
|
| | |
|
| | |
|
| | |
|
| |
|
|
| |
Added a couple of TODOs
|
| |
|
|
|
| |
starts. This is in preparation for multi-threaded solving (but don't get hyped,
it will take time).
|
| |
|
|
|
|
|
| |
once and for all. I successfully removed from the pruning table generation
part by using an alternative (slower) method, but then I realized that I also
use antindexes when generating symmetry data. So I reverted to the original
pruning table computation method, but I left the alternative way there, commented.
|
| |
|