A301860 - OEIS

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

(list; graph; refs; listen; history; text; internal format)

OFFSET

2,1

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

Table of n, a(n) for n=2..6.

Dmitry Kamenetsky, Optimal solutions

CROSSREFS

Cf. A300576.

Sequence in context: A317180 A187285 A098732 * A109394 A285687 A139704

Adjacent sequences: A301857 A301858 A301859 * A301861 A301862 A301863

KEYWORD

nonn,more

AUTHOR

Dmitry Kamenetsky, Mar 28 2018

STATUS

approved