Question

A knight moves from square `a1` to square `h8`. Is it possible that along the way it visited every square on the board exactly once?

Difficulty level (1 very easy - 10 very hard): 3

Combinatorics -> Double Counting Combinatorics -> Invariants Combinatorics -> Graph Theory Logic -> Reasoning / Logic Number Theory -> Division -> Parity (Even/Odd) Proof and Example -> Proof by Contradiction Combinatorics -> Colorings -> Chessboard Coloring

There are no comments yet.

Authentication required

You must log in to post a comment.