Brain Teasers
Brain Teasers Trivia Mentalrobics Games Community
Personal Links
Submit a Teaser
Your Favorites
Your Watchlist
Browse Teasers
All

Cryptography
Group
Language
Letter-Equations
Logic
Logic-Grid
Math
Mystery
Optical-Illusions
Other
Probability
Rebus
Riddle
Science
Series
Situation
Trick
Trivia

Random
Daily Teasers
Search Teasers

Advanced Search
Add to Google Add to del.icio.us

More ways to get Braingle...

Knights



 

Puzzle ID:#11959
Fun:*** (2.8)
Difficulty:** (2.07)
Category:Other
Submitted By:Mhalun***
Corrected By:just_moi

 

 

 



What is the maximum number of chess knights that you can place on a chess board so that none of them can attack each other in one move?





What Next?

  
  

See another brain teaser just like this one...

Or, just get a random brain teaser

If you become a registered user you can vote on this brain teaser, keep track of
which ones you have seen, and even make your own.

 



Comments

Mhalun*
Apr 27, 2003

Please give me your suggestions and comments
quisitor
Apr 29, 2003

why not 64 white (or 64 black) knights on every square?
(user deleted)
Apr 29, 2003

Never realized that! Awesome teaser!
(user deleted)
Apr 29, 2003

quisitor asks an interesting question, but I suppose it is assumed that the knights can attack each other even if they are of the same color. Otherwise trivial answers like "knights could stack one on top of another" or "in a 10x10 board, 100 knights, all of different shades of yellow" abound. Hmm... more interesting is can you prove that that is the maximum number? And as a challenge can you find the minimum number of knights that can be placed on a chess board such that every square is either attacked or occupied by a knight? (use standard rules - you know what I mean - no shades of yellow).
kghugs
May 15, 2003

this is a boring joke. i don't even get the joke.
puzzled_puzzler
May 22, 2003

Its not sopposed to be a joke. You probably have the wrong site.
(user deleted)
May 22, 2003

The solution is 14. I will leave the three placements as an exercise for the reader.
krishnanAin*
Jun 12, 2003

I think the answer to Anonymous' question is 12 and not 14 as claimed by him. I have a solution with me but I don't want to give it away.



Back to Top
   



Users in Chat : Limerick 

Online Now: 19 users and 442 guests

Copyright © 1999-2013 | Updates | FAQ | RSS | Widgets | Links | Green | Subscribe | Contact | Privacy | Conditions | Advertise

Custom Search





Sign In A Create a free account