Long walk at a museum

Discrete Mathematics Level pending

This is the map of a modern art museum. Tran Quoc Dat, a brilliant tourist want to visit all the rooms of the museum. Can he make his path? If not, what is the maximum number of rooms can he visit?

Details and assumption:

  • Every room has 4 doors which lead to 4 directions

  • If your answer is Yes, type the answer as 0(zero)

  • He could walk in the museum only once


Problem Loading...

Note Loading...

Set Loading...