On traversing labyrinths by automata in $n$-dimensional space

The problem of traversing spatial labyrinths by automata is considered. It is proved that there exists an automaton that makes one unremovable mark (colour) on vertices of a labyrinth and traverses an arbitrary $n$-dimensional rectangular labyrinth.