BitoBain
Career
- Joined
- Jun 21, 2013
- Messages
- 375
- Reaction score
- 840
You're in your history class, and the teacher is grumbling about some battle that happened in ancient Mesopotamia... But you can't fall asleep because the teacher is watching you. You need a logic puzzle!
Your problem is simple. Given an 8x8 chess board, place eight queens on it so that none of them can attack another. In other words, two queens cannot exist in the same rank, file, or diagonal. Remember, a queen can move any number of squares in any of the eight directions.
...
You have until the end of the class period to figure it out. I was able to figure it out myself without help. Those who cheat by looking it up will be sentenced to an extra history assignment. Good luck, and only use my hint if you are stumped!
Your problem is simple. Given an 8x8 chess board, place eight queens on it so that none of them can attack another. In other words, two queens cannot exist in the same rank, file, or diagonal. Remember, a queen can move any number of squares in any of the eight directions.
...
You have until the end of the class period to figure it out. I was able to figure it out myself without help. Those who cheat by looking it up will be sentenced to an extra history assignment. Good luck, and only use my hint if you are stumped!
Feel free to discuss below
Try this puzzle first with a 4x4 board with four queens, then continue onto five, etc... You might also try placing two or three queens down, then marking which squares they cover.