Solving the 8 Pawns Puzzle on an 8x8 Chess Board

  • Context: Undergrad 
  • Thread starter Thread starter superconduct
  • Start date Start date
  • Tags Tags
    Board Chess Puzzle
Click For Summary
SUMMARY

The discussion centers on the feasibility of placing 8 pawns on an 8x8 chessboard such that each pawn is at a unique distance from every other pawn, including diagonal distances. Participants explore various interpretations of the problem, with one interpretation focusing on ensuring that no two pawns lie on the perpendicular bisector of any two existing pawns. Additionally, the conversation touches on the classic 8 queens problem, questioning the similarities and differences in constraints between the two scenarios.

PREREQUISITES
  • Understanding of chessboard geometry and distances
  • Familiarity with combinatorial counting principles
  • Basic knowledge of chess piece movement and attack patterns
  • Concept of unique distances in a mathematical context
NEXT STEPS
  • Research combinatorial geometry in chessboard problems
  • Explore unique distance calculations on an 8x8 grid
  • Study the 8 queens problem and its solutions
  • Investigate algorithms for generating unique distance arrangements
USEFUL FOR

Mathematicians, puzzle enthusiasts, chess players, and anyone interested in combinatorial optimization and geometric arrangements on a chessboard.

superconduct
Messages
31
Reaction score
1
Imagine a 8x8 chess board, is it possible to place 8 pawns such that they are of different distances from one another?
 
Mathematics news on Phys.org
Asuming diagonal distances are also included, it doesn't seem like it should be too difficult with only 8 pawns.
 
superconduct said:
Imagine a 8x8 chess board, is it possible to place 8 pawns such that they are of different distances from one another?
What are your thoughts on this?
 
so are we talking a series of pawns (p(1), p(2), ... , p(8)) such that D(p(i)) - D(p(i + 1)) is different for every i? Because something like a conch shell spiral works if that's the case. More generally I think with any nxn board it should be possible to place n pawns at different distances from one another using the same method. (start at square (n -1, n +1), move one place to the right, then two places up, 3 to the left, etc...
 
D wasn't really meant to be a function by the way, just a way of signifying the concept
 
My interpretation of the problem is different. For each pair of pawns Pi and Pj, the distance must be unique.

With that interpretation, I'd treat it as a counting problem. How many distinct non-zero distances are there on an 8x8 chessboard? How many distinct pairs of pawns are there in a set of 8?
 
jbriggs444 has my interpretation.

With that interpretation, no pawns should lie on the perpendicular bisector of any two pawns already placed.
 
Here's another one: is it possible to place 8 queens on the board such that no queens are "attacking" any other queen, and why?
 
^I remember that problem. It's possible if I remember correctly
 
  • #10
please prove and explain to me
 
  • #11
Actually I'm not sure if it does work now that I'm trying to work it out... each queen eliminates a row, column, and diagonal from future options of where to place the next queen. Eventually the eliminated columns and diagonals amount to eliminating a row no matter how you place the first 4 or 5 queens, which seems to indicate that it would be impossible to put 8 queens on the board, but I'm not sure. I'd have to spend more time on it.
 
  • #12
well come to think of it, each queen eliminates two diagonals, so I'm not sure it would ever work
 
  • #13
Wikipedia says that there are 92 ways of solving the problem though, so I don't know.
 
  • #14
but is the queen version equivalent to my pawn version? I mean like when you place a queen then another directly next to it then another 1 square away from the 2nd, this is not legit in queen version but is legit in pawn version(not including future pawns)
 

Similar threads

  • · Replies 20 ·
Replies
20
Views
7K
  • · Replies 64 ·
3
Replies
64
Views
25K
  • · Replies 179 ·
6
Replies
179
Views
28K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 25 ·
Replies
25
Views
18K
  • · Replies 4 ·
Replies
4
Views
2K
Replies
29
Views
5K
Replies
4
Views
5K
  • · Replies 14 ·
Replies
14
Views
3K
  • · Replies 5 ·
Replies
5
Views
3K