Construct a Turing Machine which traverses an arbitrary maze and completely fills it with zeros.

Initial condition
The border of the maze is marked with #-symbols. The read/write-head is positioned somewhere within the maze.
Final condition
Every field within the maze must have a zero written on it.