Knight’s tour
Thursday, June 18th, 2009Categories: Fun
An item in Professor Stewart’s Cabinet of Mathematical Curiosities reminded me of a puzzle I once amused myself with during a boring physics class. I wanted to create a puzzle for the school paper where you have a 4×4 grid filled with letters and you have to use the knight’s move to visit all squares in the right order so you get a sixteen-letter word.
After I picked the word, I tried to fill all squares, but soon I suspected that what I wanted wasn’t possible; I couldn’t find a way to reach all sixteen squares using a knight’s move (one square horizontal or vertical and one diagonal) without passing any square twice. Now I had a new puzzle: prove that this is impossible.
» Read the rest of this post.

