⚡ TL;DR
Print the spiral maze path pattern in Python. Complete working code, expected output, algorithm explanation, and practice variations for beginners learning loops.
The Spiral Maze Path pattern is a classic loop exercise. Here’s the complete implementation in Python with working code and output.
Pattern to Print
##########
# #
# ###### #
# # # #
# # ## # #
# # ## # #
# # # #
# ###### #
# #
##########Implementation
def spiral_maze(n):
maze = [[' ']*n for _ in range(n)]
top, bottom, left, right = 0, n-1, 0, n-1
while top <= bottom and left <= right:
for i in range(left, right+1): maze[top][i] = '#'
top += 2
for i in range(top, bottom+1): maze[i][right] = '#'
right -= 2
if top <= bottom:
for i in range(right, left-1, -1): maze[bottom][i] = '#'
bottom -= 2
if left <= right:
for i in range(bottom, top-1, -1): maze[i][left] = '#'
left += 2
for row in maze:
print(''.join(row))
spiral_maze(10)Output
##########
# #
# ###### #
# # # #
# # ## # #
# # ## # #
# # # #
# ###### #
# #
##########How It Works
A spiral path drawn with walls: each pass adds a rectangular ring, then jumps 2 cells inward to start the next ring. Produces a clean maze-like spiral.
Practice Variations
- Try printing the pattern with a different character (e.g.,
#or+) - Modify the code to accept the pattern size as user input
- Combine this pattern with its inverse to create a more complex shape
Complexity
- Time: O(n²) — the grid or line count grows quadratically
- Space: O(1) — only loop counters are needed
Related Patterns
- Spiral Maze Path in Dart
- Spiral Maze Path in Go
- Spiral Maze Path in Swift
- Snake Matrix in Python
- Checkerboard in Python
- Hollow Cross Plus in Python
FAQ
How do you print the Spiral Maze Path pattern in Python?
Use nested loops: the outer loop walks through the rows while the inner loop prints the characters or values for each row. The complete Python implementation with expected output is shown in the sections above.
What is the time complexity of the Spiral Maze Path pattern in Python?
The time complexity is O(n²) and the space complexity is O(1), since the pattern is built with a fixed number of loop counters and printed row by row.
Happy coding!
