From b7ee185f91864cb2003ee4d56f39e12595ff4679 Mon Sep 17 00:00:00 2001 From: Jidong Xiao Date: Fri, 20 Oct 2023 13:49:24 -0400 Subject: [PATCH] not on course page, but here --- hws/06_inverse_word_search/README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/hws/06_inverse_word_search/README.md b/hws/06_inverse_word_search/README.md index 4a35970..61c8fac 100644 --- a/hws/06_inverse_word_search/README.md +++ b/hws/06_inverse_word_search/README.md @@ -41,7 +41,7 @@ rotations and reflections. ![alt text](example2.png "example2") When asked to find all solutions, your program should first output the number of solutions and then an -ASCII representation for each solution. See the example output on the course webpage. You should follow +ASCII representation for each solution. See the example output files provided in this folder. You should follow this output closely, however your solutions may be listed in a different order. When asked to find just one solution, your program should just output the first legal solution it finds (it does not need to count the number of solutions, nor does it need to be the first solution shown in our output). If the puzzle is impossible