diff --git a/curriculum/challenges/english/07-scientific-computing-with-python/learn-recursion-by-solving-the-tower-of-hanoi-puzzle/64dcd3d61c448e2676501f43.md b/curriculum/challenges/english/07-scientific-computing-with-python/learn-recursion-by-solving-the-tower-of-hanoi-puzzle/64dcd3d61c448e2676501f43.md index 48fac138222..da3d1fbf9d9 100644 --- a/curriculum/challenges/english/07-scientific-computing-with-python/learn-recursion-by-solving-the-tower-of-hanoi-puzzle/64dcd3d61c448e2676501f43.md +++ b/curriculum/challenges/english/07-scientific-computing-with-python/learn-recursion-by-solving-the-tower-of-hanoi-puzzle/64dcd3d61c448e2676501f43.md @@ -7,7 +7,7 @@ dashedName: step-20 # --description-- -When the remainder of the move number divided by 3 is equal to 2, the movement is allowed between `A` and `B` (the source and the auxiliary rods). +When the remainder of the move number divided by 3 is equal to 2, the movement is allowed between `'A'` and `'B'` (the source and the auxiliary rods). Add an `elif` statement for that. Then, print the appropriate string if the condition is met. diff --git a/curriculum/challenges/english/07-scientific-computing-with-python/learn-recursion-by-solving-the-tower-of-hanoi-puzzle/64dcd9bbc2268127e7898d77.md b/curriculum/challenges/english/07-scientific-computing-with-python/learn-recursion-by-solving-the-tower-of-hanoi-puzzle/64dcd9bbc2268127e7898d77.md index 3e5079b3d22..1a3a5620279 100644 --- a/curriculum/challenges/english/07-scientific-computing-with-python/learn-recursion-by-solving-the-tower-of-hanoi-puzzle/64dcd9bbc2268127e7898d77.md +++ b/curriculum/challenges/english/07-scientific-computing-with-python/learn-recursion-by-solving-the-tower-of-hanoi-puzzle/64dcd9bbc2268127e7898d77.md @@ -7,7 +7,7 @@ dashedName: step-21 # --description-- -Finally, when the move number divided by 3 has no remainder, the movement is allowed between `B` and `C`. +Finally, when the move number divided by 3 has no remainder, the movement is allowed between `'B'` and `'C'`. Add an `elif` statement for that. Then, print the appropriate string if the condition is met. diff --git a/curriculum/challenges/english/07-scientific-computing-with-python/learn-recursion-by-solving-the-tower-of-hanoi-puzzle/64de773f81facd14653f49c8.md b/curriculum/challenges/english/07-scientific-computing-with-python/learn-recursion-by-solving-the-tower-of-hanoi-puzzle/64de773f81facd14653f49c8.md index ce6e0756762..b549b09126c 100644 --- a/curriculum/challenges/english/07-scientific-computing-with-python/learn-recursion-by-solving-the-tower-of-hanoi-puzzle/64de773f81facd14653f49c8.md +++ b/curriculum/challenges/english/07-scientific-computing-with-python/learn-recursion-by-solving-the-tower-of-hanoi-puzzle/64de773f81facd14653f49c8.md @@ -11,7 +11,7 @@ It looks like it's working! But the output is not very readable. Print a new lin # --hints-- -You should pass a string with a new line character (`\n`) as the second argument for your two `print(rods)` calls. +You should pass a string with a new line character (`'\n'`) as the second argument for your two `print(rods)` calls. ```js ({ test: () => assert.match(code, /print\(\s*rods\s*,\s*('|")\\n\1\s*\)(?=.*print\(\s*rods\s*,\s*('|")\\n\2\s*\))/s) })