commit 2ea32ca96855f0599b9746f7f5e64b137456c744
parent 382cfb07590e7ed4b5648149052c1f17f6907bfd
Author: Ryan Wolf <rwolf@borderstylo.com>
Date: Mon, 8 Mar 2010 00:34:30 -0800
fixed links, added TODO
Diffstat:
1 file changed, 4 insertions(+), 3 deletions(-)
diff --git a/README.md b/README.md
@@ -1,9 +1,9 @@
TwistTurns
===
-Once when I was working on some (homework)[http://cs.marlboro.edu/courses/fall2008/algorithms/special/assignments#2008-09-18], I became distracted by the idea that I could graph all possible states of ("Top Spin")[http://www.jaapsch.net/puzzles/topspin.htm]-esque puzzles. After holing up in my room for two days, this project was the result.
+Once when I was working on some [homework](http://cs.marlboro.edu/courses/fall2008/algorithms/special/assignments#2008-09-18), I became distracted by the idea that I could graph all possible states of ["Top Spin"](http://www.jaapsch.net/puzzles/topspin.htm)-esque puzzles. After holing up in my room for two days, this project was the result.
-I didn't know anything about making graphs, so I offloaded that bit to (dot)[http://www.graphviz.org/]. While looking up ways to generate permutations, I came across ("Generation of Permutations by Addition")[http://www.jstor.org/pss/2003066], which I used to write perm_gen.c.
+I didn't know anything about making graphs, so I offloaded that bit to [dot](http://www.graphviz.org/). While looking up ways to generate permutations, I came across ["Generation of Permutations by Addition"](http://www.jstor.org/pss/2003066), which I used to write perm_gen.c.
Usage
---
@@ -38,5 +38,6 @@ TODO
I don't know if I'll get back to this project, but...
* soup it up until it can handle 20d4
-* primes.c seems to be using a dingy variation of the (sieve)[http://www.cs.hmc.edu/~oneill/papers/Sieve-JFP.pdf]. run benchmark on this and the related project euler (answer)[http://github.com/thebigbad/proud-jack-foiler/blob/master/010/010.pl]--I can do better.
+* primes.c seems to be using a dingy variation of the [sieve](http://www.cs.hmc.edu/~oneill/papers/Sieve-JFP.pdf). run benchmark on this and the related project euler [answer](http://github.com/thebigbad/proud-jack-foiler/blob/master/010/010.pl)--I can do better.
+* also, why does this project even need primes? before that benchmarking, see if we can pull this out entirely.
* see if I can make the permutations bit more generic for I can reuse this code for the "book of tic-tac-toe" project
