zakarya/puzzles
1
0
Fork 0
mirror of git://git.tartarus.org/simon/puzzles.git synced 2025-04-21 08:01:30 -07:00
Code Issues Packages Projects Releases Wiki Activity

Correct credits information

Browse Source
This commit is contained in:
Alexandra Lanes
2023-01-08 13:53:28 +00:00
parent 2537961b6f
commit 171e7a76ed
2 changed files with 3 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
puzzles.but
View File

@ -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}

2
solo.c
View File

@ -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