Brain Teaser #93

[davilla]

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.

[Njorl]

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

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

Njorl

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!

D'oh

[davilla]

48 if you asssume that pieces can not attack those of the same color.
Wow, that was a fast response! But no, I meant attack or defend. This is analogous to the eight queens problem.

[Njorl]

32, cover one color completely.
Njorl

[davilla]

This is analogous to the eight queens problem.
Except that it's the toddler version, for creators with brain spasms.

Next time I'll let Njorl come up with the chess problems.