Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Brain Teaser #93

  1. Apr 28, 2004 #1
    Brain Thumper #7

    What is the greatest number of knights that can be placed on a chessboard such that no two pieces are in a position to attack each other? Please provide your solution.
    Last edited: Apr 28, 2004
  2. jcsd
  3. Apr 28, 2004 #2


    User Avatar
    Science Advisor

    48 if you asssume that pieces can not attack those of the same color.

    I have a feeling you're not assuming that though.


    edit - wait, I think I have a better way.

    Hmm, you might mean it the way I stated after all.

    2nd edit. No, I was a fool. If that were the case you could put 64!

    Last edited: Apr 28, 2004
  4. Apr 28, 2004 #3
    Wow, that was a fast response! But no, I meant attack or defend. This is analogous to the eight queens problem.
  5. Apr 28, 2004 #4


    User Avatar
    Science Advisor

    32, cover one color completely.
  6. Apr 28, 2004 #5
    Except that it's the toddler version, for creators with brain spasms.

    Next time I'll let Njorl come up with the chess problems.
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook