Fun Fact of the Day: In chess, the knight can visit each square exactly once.
I swear this was a puzzle in Layton
Reblogging because I’ve always wanted to be able to do this myself.
Now I’m thinking about solving a larger problem programmatically: how many ways can one knight (in a standard starting position) visit all squares? More broadly, how many ways can one knight in any starting position visit all squares of an NxN board? Easier or harder to solve than the N queens problem?