chiark
/
gitweb
/
~ianmdlvl
/
matchsticks-search.git
/ search
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
first ⋅ prev ⋅ next
Filled in the search-algorithms section.
2014-03-29
Simon Tatham
Filled in the search-algorithms section.
commit
|
commitdiff
|
tree
2014-03-28
Simon Tatham
Filled in some gaps in the writeup.
commit
|
commitdiff
|
tree
2014-03-20
Simon Tatham
Fill in a lot of the web page.
commit
|
commitdiff
|
tree
2014-03-19
Simon Tatham
Move the HTML container out into a reworkable template...
commit
|
commitdiff
|
tree
2014-03-18
Simon Tatham
A big pile more data!
commit
|
commitdiff
|
tree
2014-03-17
Simon Tatham
One more simple dissector.
commit
|
commitdiff
|
tree
2014-03-17
Simon Tatham
Another way to make up dissections easily.
commit
|
commitdiff
|
tree
2014-03-17
Simon Tatham
Invent a dissection if none is stored.
commit
|
commitdiff
|
tree
2014-03-17
Simon Tatham
Read the full dissections and double-check them.
commit
|
commitdiff
|
tree
2014-03-16
Simon Tatham
Tweak the tabulation style.
commit
|
commitdiff
|
tree
2014-03-16
Simon Tatham
Run 'main' for (11,5), for which the bound wasn't tight.
commit
|
commitdiff
|
tree
2014-03-16
Simon Tatham
Script to tabulate results as a web page.
commit
|
commitdiff
|
tree
2014-03-16
Simon Tatham
print.py is now obsolete.
commit
|
commitdiff
|
tree
2014-03-16
Simon Tatham
Commit a big pile of search results.
commit
|
commitdiff
|
tree
2014-03-15
Simon Tatham
Fix hang during output of (7,6).
commit
|
commitdiff
|
tree
2014-03-15
Simon Tatham
Ahem, typo.
commit
|
commitdiff
|
tree
2014-03-15
Simon Tatham
Output dissection in the same format as partition.py.
commit
|
commitdiff
|
tree
2014-03-14
Simon Tatham
Generate output the right way round!
commit
|
commitdiff
|
tree
2014-03-14
Simon Tatham
Use known bound data to refine the search space.
commit
|
commitdiff
|
tree
2014-03-14
Simon Tatham
Implement some trivial bounds as well as the interesting...
commit
|
commitdiff
|
tree
2014-03-14
Simon Tatham
Fix a bug causing some solutions to be missed, e.g...
commit
|
commitdiff
|
tree
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