A301860 Number of steps required in the worst case for n knights to find the princess in a castle with rooms arranged in a (n+1) X (n+1) grid (Castle and princess puzzle).

10, 12, 12, 14, 16

Offset: 2

Author

Dmitry Kamenetsky, Mar 28 2018

Keywords

• nonn
• more

Comments

The main entry for this problem is A300576. In this version there are n knights who are searching for the princess inside a grid; each knight can search a different room.

It is not possible to solve the n X n grid with fewer than (n-1) knights.

a(2) and a(3) were found by Robby Goetschalckx.

Links

• Dmitry Kamenetsky, Optimal solutions

Crossrefs

Cf. A300576.