Add to ORKGPart I showed that the number of ways to place q nonattacking queens or similar chess pieces on an n × n square chessboard is a quasipolynomial function of n. We prove the previously empirically observed period of the bishops quasipolynomial, which is exactly 2 for three or more bishops. The proof depends on signed graphs and the Ehrhart theory of inside-out polytopes
The famous n-queens problem asks how many ways there are to place n queens on an n × n chessboard so...
AbstractWe present some new solutions to the problem of arranging n queens on an n × n chessboard wi...
Abstract. The function that counts the number of ways to place nonattacking identical chess or fairy...
Abstract. By means of the Ehrhart theory of inside-out polytopes we establish a general counting the...
Abstract. We apply to the n × n chessboard the counting theory from Part I for nonat-tacking placeme...
Abstract. Parts I and II showed that the number of ways to place q nonattacking queens or similar ch...
Abstract. The function that counts the number of ways to place nonattacking identical chess or fairy...
Number the cells of a (possibly infinite) chessboard in some way with the numbers 0, 1, 2, … . Consi...
It is shown how the placement of non-attacking bishops on a chessboard C is related to the matching ...
Given a regular chessboard, can you place eight queens on it, so that no two queens attack each othe...
Given a regular chessboard, can you place eight queens on it, so that no two queens attack each othe...
AbstractIt is shown that the problem of covering an n × n chessboard with a minimum number of queens...
This master thesis discusses various mathematical problems related to the placement of chess pieces....
A legal placement of Queens is any placement of Queens on an order N chessboard in which any two att...
AbstractWe present some new solutions to the problem of arranging n queens on an n × n chessboard wi...
The famous n-queens problem asks how many ways there are to place n queens on an n × n chessboard so...
AbstractWe present some new solutions to the problem of arranging n queens on an n × n chessboard wi...
Abstract. The function that counts the number of ways to place nonattacking identical chess or fairy...
Abstract. By means of the Ehrhart theory of inside-out polytopes we establish a general counting the...
Abstract. We apply to the n × n chessboard the counting theory from Part I for nonat-tacking placeme...
Abstract. Parts I and II showed that the number of ways to place q nonattacking queens or similar ch...
Abstract. The function that counts the number of ways to place nonattacking identical chess or fairy...
Number the cells of a (possibly infinite) chessboard in some way with the numbers 0, 1, 2, … . Consi...
It is shown how the placement of non-attacking bishops on a chessboard C is related to the matching ...
Given a regular chessboard, can you place eight queens on it, so that no two queens attack each othe...
Given a regular chessboard, can you place eight queens on it, so that no two queens attack each othe...
AbstractIt is shown that the problem of covering an n × n chessboard with a minimum number of queens...
This master thesis discusses various mathematical problems related to the placement of chess pieces....
A legal placement of Queens is any placement of Queens on an order N chessboard in which any two att...
AbstractWe present some new solutions to the problem of arranging n queens on an n × n chessboard wi...
The famous n-queens problem asks how many ways there are to place n queens on an n × n chessboard so...
AbstractWe present some new solutions to the problem of arranging n queens on an n × n chessboard wi...
Abstract. The function that counts the number of ways to place nonattacking identical chess or fairy...