Skip to main content

All Questions

Filter by
Sorted by
Tagged with
9 votes
0 answers
355 views

The $n$ queens problem with no three on a line

The $n$ queens problem asks if we can place $n$ queens on an $n\times n$ chessboard such that no two queens attack one another. For example, when $n=8$, here are two solutions (images taken from ...
ho boon suan's user avatar
5 votes
1 answer
1k views

How many consecutive forced moves are possible in chess?

The question concerns chess. I call a move forced if, in a given position, is the unique move consistent with the rules of the game. I wonder what is the largest integer $n$ such that there exists a ...
Alessandro Della Corte's user avatar
11 votes
2 answers
1k views

Algebraic properties of graph of chess pieces

For the purpose of this question, a chess piece is the King, Queen, Rook, Bishop or Knight of the game of chess. To a chess piece is attached a graph which represents the legal moves it can make on an ...
Olivier's user avatar
  • 10.9k
8 votes
1 answer
487 views

Knight's tour problem

It is known that on an infinite board, if all squares of the form $(ki,kj)$ are removed, $k$ even, $i,j\in\mathbf{Z}$, then there is no knight's tour due to unbalanced black and white squares. My ...
Haoran Chen's user avatar
19 votes
1 answer
1k views

Knight's tours in higher dimensions

I wonder if Knight's Tours have been explored in higher dimensions, using the following definition of a knight move. In dimension $d=2$, the knight moves left/right and forward/back one step and two ...
Joseph O'Rourke's user avatar
22 votes
5 answers
3k views

Irreversible chess

Suppose we play a chess-variant, where any finite number of pieces are allowed, and the board is as large as we wish, but only two kings in total. And there is no 50 move-rule, no castling and no ...
GM2001's user avatar
  • 223
11 votes
1 answer
2k views

Is the space of solutions to the Queens Domination Problem connected?

A configuration of queens on an 8 by 8 chessboard (or n by n if you like) is a queen domination if every square on the board lies in the same row, column, or diagonal as at least one of the queens. ...
David Steinberg's user avatar