Brain Teaser #93: Solve the Chessboard Knight's Puzzle

  • Context: High School 
  • Thread starter Thread starter davilla
  • Start date Start date
  • Tags Tags
    Brain
Click For Summary

Discussion Overview

The discussion revolves around the problem of determining the maximum number of knights that can be placed on a chessboard without any two knights being able to attack each other. The scope includes theoretical reasoning and mathematical exploration related to chess puzzles.

Discussion Character

  • Exploratory, Technical explanation, Debate/contested, Mathematical reasoning

Main Points Raised

  • One participant suggests that 48 knights can be placed on the board if they cannot attack knights of the same color.
  • Another participant questions this assumption and clarifies that the intent was to consider all attacking and defending positions, likening it to the eight queens problem.
  • A different participant proposes that 32 knights can be placed by covering one color completely.
  • One participant humorously remarks on the simplicity of the problem compared to the eight queens problem.

Areas of Agreement / Disagreement

Participants express differing views on the maximum number of knights that can be placed without attacking each other, with no consensus reached on the correct number or assumptions involved.

Contextual Notes

There are unresolved assumptions regarding the conditions under which knights can attack each other, particularly concerning color and the definition of "attack." The discussion reflects varying interpretations of the problem.

davilla
Messages
88
Reaction score
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:
Mathematics news on Phys.org
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:
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.
 
32, cover one color completely.
Njorl
 
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.
 

Similar threads

High School The eight-queens chess puzzle and variations of it
  • · Replies 20 ·
Replies
20
Views
10K
Undergrad How many ways can two knights threaten each other on a chessboard?
  • · Replies 8 ·
Replies
8
Views
3K
High School Interesting logic puzzles and brain teasers
  • · Replies 7 ·
Replies
7
Views
9K
High School New solutions to old, historic problems
  • · Replies 2 ·
Replies
2
Views
3K
Java How does backtracking work in solving the n queens problem?
  • · Replies 5 ·
Replies
5
Views
3K
High School How Do You Solve This Mysterious Number Puzzle?
  • · Replies 10 ·
Replies
10
Views
3K
Graduate Combinatorics Arrangement Problem
  • · Replies 5 ·
Replies
5
Views
2K
High School Can you solve Penrose's chess problem and win a bonus prize?
  • · Replies 179 ·
6
Replies
179
Views
29K
Undergrad Can anyone help me solve this chessboard question?
  • · Replies 4 ·
Replies
4
Views
3K
What is the Maximum Number of Equivalence Classes for the Eight Queens Problem?
  • · Replies 1 ·
Replies
1
Views
3K