summaryrefslogtreecommitdiff
path: root/capset.go
AgeCommit message (Collapse)Author
2014-07-04Revert "Support filtering sub capsets"Eric Anderson
This reverts commit f962e9656116cfe611500809344fb5bc1959d935. It didn't actually work in many common cases, and making it work is outside the scope of what we want to do when finding capsets. Thus, we will try to solve this with a post-processing script instead, which really fits with our needs better anyway (to prevent having to find solutions twice). Example of case that failed to be detected: [000 001 010 011 100 101 112 122 212] [000 001 010 011 100 101 112 212]
2014-07-03Support filtering sub capsetsEric Anderson
2014-07-03Add option to keep maxim fixedEric Anderson
2014-07-03Add flags and improve usage messageEric Anderson
2014-07-03Add docs for CapsetEric Anderson
2014-07-03Remove Sync() from file savingEric Anderson
It was intended to be a Flush(), but even Flush() is unnecessary because we aren't doing buffered I/O. This speeds up fully solving dimension 3 from 20 seconds to .1 seconds.
2014-07-03Add comments to bitwise matchingEric Anderson
2014-07-03Delete commented out codeEric Anderson
2014-07-03Swap to bitwise hasSet()Eric Anderson
Using bitwise operations yields over a 2x speedup. The iteration order of hasSet was reversed which causes it to be within 60% of the performance of hasSetWithLast, instead of 6x slower. It was also rewritten to use hasSetWithLast for better code reuse.
2014-07-03go fmt fixesEric Anderson
2014-07-02Reversed the card orderJoe Anderson
2014-07-02Added arg parsing and test case, fixed an ungeneralized 18Joe Anderson
2014-07-01Generalize to any dimension, organizing in the processEric Anderson
2014-06-30Performance improvements, tests, and benchmarksEric Anderson
2014-06-30Faithful port to GoEric Anderson
It is around 60 times faster