Daily Math Puzzle 2026/11/01

Original Post on X

English

Let \(n\) be an integer with \(n\geq2\). We want to trace every line segment of a grid with \(n\) rows and \(n\) columns of cells exactly once. The pen may be put down or lifted only at grid points. At every grid point encountered within a stroke, the pen must turn right; it may neither go straight nor turn back. What is the minimum number of strokes needed?

日本語

\(n\) を2以上の整数とする. 縦横 \(n\) マスの方眼の線を,すべて1回ずつなぞりたい. ペンを下ろす点と上げる点は格子点に限る. 途中の格子点では必ず右に曲がり,直進も引き返しもできない. 最少何筆でなぞれるか.

Try it