Source: Maths Jam
A princess lives in a row of 17 rooms. Each day she moves to a room adjacent to the one she wakes up in (eg. If she sleeps in room 5 today, then she will sleep in room 4 or 6 tomorrow). If you are able to find the princess by only opening one door each night then you will become her prince. Can you find her in a finite number of moves?