Consider the following building floor plan, with a set of rooms labeled A-G and an Outside:
The lines between each pair of blue dots are walls. Ordinarily in problems like this the goal is to draw a single continuous curve that passes through each wall once and only once, ending up back in the room where the curve was started (a so-called "Hamiltonian cycle").
However, for this particular set of rooms, the real challenge is to get stuck. Getting "stuck" means you draw your curve so that you eventually have no way of exiting the room you're in (because you've passed through all of its walls once) even though you haven't passed through all the walls in the building.
You can start your curve in any room, but not on the outside of the building.
Can you get stuck on purpose?
To present your solution to the problem, please give the sequence of rooms your curve passes through, beginning with the room you start in. For example, a curve that starts in room G and ends at the x (as shown below) has the sequence
G Out B A Out.