chiark / gitweb /
~ianmdlvl / matchsticks-search.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: a0e1974) | patch
Python code to compute upper bounds on the solution.
authorSimon Tatham <anakin@pobox.com>
Wed, 12 Mar 2014 20:46:11 +0000 (20:46 +0000)
committerSimon Tatham <anakin@pobox.com>
Wed, 12 Mar 2014 20:46:11 +0000 (20:46 +0000)
commit86575cc1251eca190aacac95dcb498d4efb4e7a2
treef2a4d2636c393e11428efd65fbd9dc88f21bf10atree | snapshot
parenta0e19749b5c7edccf558fc336fff917d837fa103commit | diff
Python code to compute upper bounds on the solution.

Since I now know of two different ways to prove an upper bound, here's
a piece of code which tries both, picks the lowest, and explains which
one gave rise to the number it returns.
.gitignore diff | blob | history
bounds.py [new file with mode: 0644] blob
Unnamed repository; edit this file 'description' to name the repository.