Knight tour?

Is it possible for a knight to make a series of moves, landing on each square once (not landing on any sqaure more than once)?

Yes, someone posted a thread in this forum with one answer. It was interesting to watch. It was about a month ago. Definitely possibly.

Also, it is possible to put 8 queens on the board without any of them guarding each other. I saw a picture of one solution in a chess book. Over a hundred years ago people knew of 92 such solutions, but I think they only knew 1/4 as many since of mirror reflections probably counting as extra solutions. Then there are rotational differences. But 92/8 is not a whole number. So maybe they actually meant 92 solutions.

This is pretty easy, have the knight start in the corner and have it move around the edges of the board first, then the center.

Here's the solution I use: http://www.borderschess.org/KTsimple.htm