aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorAlexandra Lanes <ajlanes@chiark.greenend.org.uk>2023-01-08 13:53:28 +0000
committerAlexandra Lanes <ajlanes@chiark.greenend.org.uk>2023-01-08 13:53:28 +0000
commit171e7a76ed271b90ab8717939c02c1bce9b1fced (patch)
tree9ab33562c0e170e828e7d9fd09c9ec23102f0804
parent2537961b6f84ce0268510f844f119bdb012ca282 (diff)
downloadpuzzles-171e7a76ed271b90ab8717939c02c1bce9b1fced.zip
puzzles-171e7a76ed271b90ab8717939c02c1bce9b1fced.tar.gz
puzzles-171e7a76ed271b90ab8717939c02c1bce9b1fced.tar.bz2
puzzles-171e7a76ed271b90ab8717939c02c1bce9b1fced.tar.xz
Correct credits information
-rw-r--r--puzzles.but4
-rw-r--r--solo.c2
2 files changed, 3 insertions, 3 deletions
diff --git a/puzzles.but b/puzzles.but
index 02e65cf..bb57ca7 100644
--- a/puzzles.but
+++ b/puzzles.but
@@ -1866,9 +1866,9 @@ different colours. Two regions which meet at only one \e{point}
I believe this puzzle is original; I've never seen an implementation
of it anywhere else. The concept of a \i{four-colouring} puzzle was
-suggested by Owen Dunn; credit must also go to Nikoli and to Verity
+suggested by Alexandra Lanes; credit must also go to Nikoli and to Verity
Allan for inspiring the train of thought that led to me realising
-Owen's suggestion was a viable puzzle. Thanks also to Gareth Taylor
+Alex's suggestion was a viable puzzle. Thanks also to Gareth Taylor
for many detailed suggestions.
\H{map-controls} \i{Map controls}
diff --git a/solo.c b/solo.c
index addcf80..bac19a0 100644
--- a/solo.c
+++ b/solo.c
@@ -20,7 +20,7 @@
* + while I'm revamping this area, filling in the _last_
* number in a nearly-full row or column should certainly be
* permitted even at the lowest difficulty level.
- * + also Owen noticed that `Basic' grids requiring numeric
+ * + also Alex noticed that `Basic' grids requiring numeric
* elimination are actually very hard, so I wonder if a
* difficulty gradation between that and positional-
* elimination-only might be in order