chiark
/
gitweb
/
~ianmdlvl
/
matchsticks-search.git
/ search
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
first ⋅ prev ⋅ next
Add a -v option.
2014-03-14
Simon Tatham
Add a -v option.
commit
|
commitdiff
|
tree
2014-03-13
Simon Tatham
An entirely different search program.
commit
|
commitdiff
|
tree
2014-03-12
Simon Tatham
Report the bounds along with the search results.
commit
|
commitdiff
|
tree
2014-03-12
Simon Tatham
Python code to compute upper bounds on the solution.
commit
|
commitdiff
|
tree
2014-03-12
Simon Tatham
Written a post-analyser for the search output.
commit
|
commitdiff
|
tree
2014-03-11
Simon Tatham
Don't call set_best before setting m and n.
commit
|
commitdiff
|
tree
2014-03-10
Simon Tatham
Introduce a 'make clean' target.
commit
|
commitdiff
|
tree
2014-03-10
Simon Tatham
Introduce a 'make test' target.
commit
|
commitdiff
|
tree
2014-03-10
Simon Tatham
Compare against n_max_frags with <=, not <.
commit
|
commitdiff
|
tree
2014-03-09
Simon Tatham
Fix occasional 'min fragment 1.11022e-16' glitch.
commit
|
commitdiff
|
tree
2014-03-08
Simon Tatham
Check max Hamming weight in the other direction.
commit
|
commitdiff
|
tree
2014-03-08
Simon Tatham
Prune by symmetry: constrain 1st adj row to all 1s...
commit
|
commitdiff
|
tree
2014-03-08
Simon Tatham
Separate stdout from stderr.
commit
|
commitdiff
|
tree
2014-03-08
Simon Tatham
Output the actual dissection, as a matrix.
commit
|
commitdiff
|
tree