Can anyone help me solve this chessboard question?

  • Context: Undergrad 
  • Thread starter Thread starter SeanP
  • Start date Start date
Click For Summary

Discussion Overview

The discussion revolves around a chessboard problem involving the rearrangement of pieces while maintaining adjacency. Participants explore whether it is possible for pieces to occupy different positions after a specific rearrangement, particularly when certain pieces are fixed in place. The scope includes conceptual reasoning and mathematical exploration related to adjacency and movement constraints on a chessboard.

Discussion Character

  • Exploratory
  • Conceptual clarification
  • Mathematical reasoning

Main Points Raised

  • One participant suggests simplifying the problem by examining smaller chessboards, such as 2x2 or 3x3, to understand possible rearrangements while preserving adjacency.
  • Another participant interprets the question as related to pairing adjacent squares and references the domino covering problem, questioning the implications of color adjacency (white and black squares).
  • A different participant expresses confusion about the rules of movement, particularly whether pieces can be moved multiple times or only once, which may affect the outcome of the problem.
  • There is a discussion about the implications of fixing one or both pieces in the corner and how that might influence the ability to rearrange other pieces.

Areas of Agreement / Disagreement

Participants do not appear to reach a consensus on the interpretation of the problem or the rules governing piece movement. Multiple competing views and uncertainties remain regarding the conditions of the rearrangement and its implications.

Contextual Notes

Participants express varying levels of understanding of the problem's constraints, leading to different interpretations of how pieces can be moved and whether certain configurations are possible. There is also ambiguity regarding the fixed positions of pieces and their impact on the overall arrangement.

SeanP
Messages
4
Reaction score
0
Chessboard Question - HELP!

A chessboard is square of rectangular. Adjacent squares=squares with common side. A piece is put in each square of board, then they're picked up and put back down again in a way that the adjacent pieces are still adjacent.

If both pieces in the lefthand corner are kept in place and not picked up when the rest are rearranged (but still adjacent to each other as before), then is it possible for any piece to be in different positions the second time?

Would the answer to the above change if only one of the lfthand corner prices is kept fixed? Can this be generalised to any other piece remaining fixed on the board?

Can anyone help?
 
Mathematics news on Phys.org
One thing I do on many problems is try simpler cases. What about a 2x2 chessboard? Or maybe a 3x3 chessboard? Try generating all possible rearrangements (that preserve adjacency) in these...
 
I'm not exactly sure I understand the question. Must all but the two opposite corner pieces be moved? Basically it looks, from experience, as though you're attempting to pair up adjacent squares, ie by covering the two pieces you swap with a domino. In this case you're doing the famous 'can you cover a chess board with dominoes question'. Hint if two squares are adjacent and one's white, what must the other one be?
 
I don't understand your reference to swapping with a domino.
The other one must be black.
 
I am saying if you swap two adjacent pieces, cover their squares with a domino. But I'm not sure I understand the instructions you originally gave. Suppose we've got this set up, and I swap the piece on one square with one next to it. Am I allowed in a subsequent swap to move either of those pieces again, or have they had their move and that's that, you move on and swap another pair, if any.

If, once you've swapped over two pieces that's their move done and they can take no further part in the operation (which I think must be the case or the questions easy to answer) then when you swap a pair of pieces, one's on a white square the other is ona black square, can you see how that might help? I'm not sure that is answering your question though, now. So forget it. In fact I'm certain it doesn't - the penny has dropped and I now see what you're asking, and this isn't the answer (at least it wasn't intended to be, if it does solve it it's a fluke).
 
Last edited:

Similar threads

Bishops and permutations on chessboard
  • · Replies 23 ·
Replies
23
Views
4K
High School Number of Paths on 5x5 Chessboard: Solve the Puzzle!
  • · Replies 3 ·
Replies
3
Views
4K
Undergrad Is the proof of the KRK endgame theorem rigorous and original?
  • · Replies 13 ·
Replies
13
Views
3K
Showing that a tiling of a chessboard is impossible
  • · Replies 3 ·
Replies
3
Views
2K
Graduate Falling polygons: meshing vs. stacking - analytic solution needed
  • · Replies 1 ·
Replies
1
Views
2K
Undergrad "Programmable" Robot Maze: Possible Paths?
  • · Replies 5 ·
Replies
5
Views
2K
Undergrad Creating a fair playing field for an odd number of players
  • · Replies 6 ·
Replies
6
Views
3K
MHB How Can I Efficiently Cut Wood Boards of Different Lengths?
  • · Replies 4 ·
Replies
4
Views
4K
Undergrad Optimization problem with multiple outputs: impossible?
  • · Replies 6 ·
Replies
6
Views
3K
Forces created by fixed tarp in the wind
  • · Replies 12 ·
Replies
12
Views
3K