Mazes in Python: Store and Solve (Recap)

Congratulations on completing this video course!

You’ve successfully built a maze solver in Python, which you can use to find one or more solutions to mazes stored in your custom binary file format. You know how to represent the maze both in object-oriented and graph form suitable for the NetworkX library and how to visualize it using scalable vector graphics. Finally, you made a self-contained, runnable Python package with a command-line interface.

In this video course, you’ve learned how to:

• Use an object-oriented approach to represent the maze in memory
• Define a specialized binary file format to store the maze on disk
• Transform the maze into a traversable weighted graph
• Use graph search algorithms in the NetworkX library to find the solution
• Visualize the maze and its solution using scalable vector graphics (SVG)

To review course concepts, check out:

• 📰 The Walrus Operator: Python 3.8 Assignment Expressions
• 🎬 Python Assignment Expressions and Using the Walrus Operator
• 📰 Bitwise Operators in Python
• 🎬 Binary, Bytes, and Bitwise Operators in Python
• 📰 Python’s Instance, Class, and Static Methods Demystified
• 🎬 OOP Method Types in Python: @classmethod vs @staticmethod vs Instance Methods
• 📰 Data Classes in Python 3.7+ (Guide)
• 🎬 Using Data Classes in Python
• 📰 Build Enumerations of Constants With Python’s Enum
• 📰 Write Pythonic and Clean Code With namedtuple
• 🎬 Writing Clean, Pythonic Code With namedtuple
• 📰 Python Type Checking (Guide)
• 🎬 Python Type Checking