Log in

No account? Create an account
Previous Entry Share Next Entry
Silly Kaniggit!
twitch sigil
The idea behind the Knight's Tour is to trace a path of legal moves across a chess board with the Knight, landing on each square exactly once. Apparently, as is often the case with chess problems, there is a lot of mathematical goo that can be enjoyed by exploring this seemingly-simple idea.

It's rather hard to keep track of which squares have been visited by the Knight and which haven't, with a traditional chess board. A well-designed applet over at the Worle Wide Chess Puzzles Page [sic] provides a convenient virtual chessboard for fiddling with this.

The degree of success of an attempted but incomplete Tour can be measured by how many squares have been visited. Try it without consulting the linked page about Warnsdorff's rule first, and see how many squares you can get before dead-ending (or getting a full Tour!). I scored 62 after a couple of aborted attempts and some initial practice on the 3x4 and 5x5 boards.

For those of you who aren't yet bored to tears, they also have a very nice applet for working the Queens Problem, which has always been a favourite of mine since it was proposed to me in 6th or 7th grade. And this time, damn it, I had to attempt it way too many times before I found the solution, again. Every time I solve the Queens Problem I try to memorise the pattern on the board, and every time I try again any significant amount of time later, I've forgotten it and need to solve it all over again. I thought I had it down last time, for once and all.

So anyway, yeah. Chess problems, go lookee. Neat. And if you want background, go here.

  • 1
Now *this* is pretty geeky.

  • 1