OFFSET
1,2
COMMENTS
This is a logic puzzle. There is a castle with n rooms arranged in a line. The princess living in the castle sleeps in a different room each night, but always one adjacent to the one in which she slept on the previous night. She is free to choose any room in which to sleep on the first night. A prince would like to find the princess, but she will not tell him where she is going to sleep each night. Each night the prince can look in a single room. What strategy should he follow in order to guarantee that he finds the princess as quickly as possible?
Christian Perfect (see link) considered the case when the rooms are arranged as a general graph. He showed that the set of solvable graphs is exactly the set of trees not containing the "threesy" subgraph, which is A130131. He also showed that for d-level binary trees with 1 <= d <= 4 the number of required nights is 1, 2, 6, 18. Binary trees with d >= 5 are unsolvable as they contain "threesy".
LINKS
Christian Perfect, Solving the princess on a graph puzzle.
Puzzling Stack Exchange, Why does this solution guarantee that the prince knocks on the right door to find the princess?.
standupmaths, Youtube, The Castle and the Princess Puzzle.
Index entries for linear recurrences with constant coefficients, signature (2,-1).
FORMULA
For n >= 3, a(n) = 2*n - 4.
From Chai Wah Wu, Apr 14 2024: (Start)
a(n) = 2*a(n-1) - a(n-2) for n > 4.
G.f.: x*(2*x^3 - x^2 + 1)/(x - 1)^2. (End)
EXAMPLE
For n = 1, there is only room to search, so a(1) = 1.
For n = 2, the prince searches room 1 on the first night. If the princess is not there that means she was in room 2. If the prince searches room 1 again then he is guaranteed to see the princess as she has to move from room 2 to room 1 (she cannot stay in the same room). So a(2) = 2.
For n = 3, the prince searches room 2 on the first night. If the princess is not there that means she was either in room 1 or 3. On the second night she must go to room 2 and this is where the prince will find her. So a(3) = 2.
For n = 4, an optimal solution is to search rooms (2,3,3,2), so a(4) = 4.
For n = 5, an optimal solution is to search rooms (2,3,4,4,3,2), so a(5) = 6.
In the general case for n >= 3, an optimal solution is to search rooms (2,3,...,n-1,n-1,...,3,2), so a(n) = 2*n - 4.
MATHEMATICA
CoefficientList[ Series[(2x^3 - x^2 + 1)/(x - 1)^2, {x, 0, 62}], x] (* Robert G. Wilson v, Mar 12 2018 *)
Join[{1, 2}, Range[2, 200, 2]] (* Harvey P. Dale, Jan 25 2019 *)
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Dmitry Kamenetsky, Mar 09 2018
STATUS
approved