fix(curriculum): update step 46 hanoi tower comment (freeCodeCamp#58172)

Co-authored-by: Krzysztof G. <[email protected]>

Author: a2937

curriculum/challenges/english/07-scientific-computing-with-python/learn-recursion-by-solving-the-tower-of-hanoi-puzzle/64df45a3ad4f8719e5355244.md

@@ -16,7 +16,42 @@ For now, each recursive call prints the `rods` dictionary without performing any
 You should remove the last element from the `rods[source]` list and append it to the `rods[target]` list before the `print` call.
 
 ```js
-({ test: () => assert.match(code, /move\(\s*n\s*-\s*1\s*,\s*source\s*,\s*auxiliary\s*,\s*target\s*\)\s+rods\s*\[\s*target\s*\]\s*\.append\(\s*rods\s*\[\s*source\s*\]\s*\.pop\(\s*\)\s*\)/) })
+({ test: () => assert.isTrue(runPython(`
+_log = []
+def capture_print(*args):
+    _log.append(repr(args))
+
+old_print = print
+print = capture_print
+
+old_rods = rods
+rods2 = {
+    'A': list(range(5, 0, -1)),
+    'B': [],
+    'C': []
+}
+rods = rods2
+
+move(5, 'A', 'B', 'C')
+rods = old_rods
+print = old_print
+
+_expected_prints = [
+r"({'A': [5, 4, 3, 2], 'B': [], 'C': [1]}, '\\n')",
+r"({'A': [5, 4, 3], 'B': [], 'C': [1, 2]}, '\\n')",
+r"({'A': [5, 4], 'B': [], 'C': [1, 2, 3]}, '\\n')",
+r"({'A': [5], 'B': [], 'C': [1, 2, 3, 4]}, '\\n')",
+r"({'A': [], 'B': [], 'C': [1, 2, 3, 4, 5]}, '\\n')",
+]
+
+for args in _log:
+    if not _expected_prints:
+        break
+    if args == _expected_prints[0]:
+        _expected_prints.pop(0)
+
+not rods2['A'] and rods2['C'] == list(range(1, 6)) and not _expected_prints
+`))})
 ```
 
 # --seed--