guitarzan wrote:
Okay, okay, here's one:
Think of the way a Knight moves (Bob Seger is heard in the background). Say it's all by itself on the chessboard, at a1. It can move from there to b3 or c2. If it were at a2, it could move to c1, c3, or or b4. If it were at a3, it could move to b1, c2, c4, or b5. I hope you're catching on. So the question becomes:
What is the total of the available destinations for a Knight played from each of the 64 squares?
you're forgetting to include (for the extra fun) checks, checkmates and captures and the different notations that arise when two (or more!) knights can jump to the same square *head spins*
Man I thought memorizing the Knights Tour was enough. Now this takes chess obsession to a whole other level.
corners 2 squares
rim 3 squares
2nd/7th ranks b/g files 4 squares
3-6th ranks c-f files 8 squares
4x2=8 3x24=72 (80) 20x4=80 (160) 16x8=128 (288)
288 available moves yet only 64 squares.
You're forgetting the sqaures that only have 6 possible moves!
So instead of 3x24 I think you should have 8x24, the other 16 sqaures have 6 possible moves.
So 4x2 + 8x3 + 20x4 + 16x8 + 16x6 = 336
I guess that solves my mystery :p
Here's the old picture I have on my computer: