Brain Teaser #93

  • Thread starter davilla
  • Start date
  • #1
88
0
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:

Answers and Replies

  • #2
Njorl
Science Advisor
267
15
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
 
Last edited:
  • #3
88
0
Njorl said:
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.
 
  • #4
Njorl
Science Advisor
267
15
32, cover one color completely.
Njorl
 
  • #5
88
0
davilla said:
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.
 

Related Threads on Brain Teaser #93

  • Last Post
Replies
1
Views
6K
  • Last Post
Replies
7
Views
3K
  • Last Post
Replies
3
Views
3K
  • Last Post
Replies
8
Views
3K
  • Last Post
Replies
15
Views
3K
  • Last Post
Replies
10
Views
2K
  • Last Post
Replies
4
Views
3K
  • Last Post
Replies
10
Views
4K
  • Last Post
Replies
2
Views
1K
  • Last Post
Replies
4
Views
3K
Top