The Maze Construction Problem

• Given:

  • collection of rooms: V
  • connections between rooms (initially all closed): E

• Construct a maze:

  • collection of rooms: V? = V
  • designated rooms in, i?V, and out, o?V
  • collection of connections to knock down: E? ? E
    such that one unique path connects every two rooms

Previous slide

Next slide

Back to first slide

View graphic version