Problem 60541. Compute the number of squares a knight can reach after n moves

Suggested Problems

• Maximum running product for a string of numbers

  2198 Solvers

• Multiply a column by a row

  792 Solvers

• matrix zigzag

  305 Solvers

• Sum the numbers on the main diagonal

  590 Solvers

• Too Many Zeros, Dump Them!

  248 Solvers

More from this Author291

• Compute a nested cube root

  14 Solvers

• Compute the polylogarithm for real arguments

  2 Solvers

• List the vile numbers

  10 Solvers

• Find the minimum element coprime to the rest in a set of 10 consecutive integers

  5 Solvers

• Compute the sum of distances from a point to the sides of an equilateral triangle

  6 Solvers