Commit my work so far on a generator for Nikoli's `Block Puzzle'. It

[sgt-puzzles.git] / unfinished / divvy.c

diff --git a/unfinished/divvy.c b/unfinished/divvy.c
index d083e766c9234aa7057025942c02a106baa31056..5c7fa27bc85fdeb1cb88490660fcdca725b6fe35 100644 (file)
--- a/unfinished/divvy.c
+++ b/unfinished/divvy.c
@@ -19,7 +19,10 @@
  *    an omino and failing if that particular square doesn't
  *    happen to work.
  * 
- * However, I don't currently think it's neecss~|~
+ * However, I don't currently think it's necessary to do either of
+ * these, because the failure rate is already low enough to be
+ * easily tolerable, under all circumstances I've been able to
+ * think of.
  */
 
 #include <assert.h>