GitHub Copilot has solved this problem quite well. It's amazing.

I think I misunderstood. Assuming the knight is in the center, it can reach anywhere on the chessboard in the 4th move. So how can this kata work for n=10?

Beautiful!

very basic but fast!

great.

very interesting!

should be 5 kyu.

descriptions table contains fish size only to 6.

test case contains to 9.

we can expect fish size up fomula. but that's cofusing.

brilliant kata!

I missread "numbers starting from 1 up to n" as "numbers n counts"...

thank you!

I got trouble with descriptions 'range is [0,pi]'

how about '[0, Math.PI]' or '[0, PI]'?

I thought 'pi' was 'point of i index'

how about hive kata using jagged array?
should be 5 kyu i think. (and i will get headach)

c#

thank you!