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).
offset: 2
codomain: ℕ
The OEIS sequence has the tags “hard” and/or “more” and few known values. It is likely that the Lean code is not representing the actual sequence, even though it coincides in the known values.
Declarations
Section titled “Declarations”- A301860computable