olymmath

HMMT November 2022 U8

  • Guts
  • Answer

Kimothy starts in the bottom-left square of a 4 by 4 chessboard. In one step, he can move up, down, left, or right to an adjacent square. Kimothy takes 16 steps and ends up where he started, visiting each square exactly once (except for his starting/ending square). How many paths could he have taken?

Dataset text NuminaMath olympiads. Quoted with source.

Show the answer

12

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator hmnt/2022/u8 · Tag SXSM9YVY4W · Edit this page on GitHub · Keys: j next, k previous