Website and data research by 101Leafy.
Puzzle D13: A Clean Sweep
Plot the most efficient route for hotel housekeeping.
How to play
This hotel needs cleaning, but the cleaner can't waste any time visiting the same room twice! Fill in a route that lets her clean the rooms as efficiently as possible.
Since she can't visit any room twice, the route mustn't contain any junctions. If she can't clean a room on her way round, touch its door to leave a note.
Don't leave notes on doors adjacent to each other, or the hotel will get a bad reputation. To remove a note from a door, simply touch the door again.
Finally, you'll see the hotel is also divided into outlined areas. The cleaner can only enter and exit each of these areas once, so plan the route carefully.
Answer
Hints you open and puzzles you mark solved are kept in this browser.