• Publications
  • Influence
Reflections on the N + k Queens Problem
The problem Clearly, we can put no more than N mutually nonattacking queens on the N × N board, since a row (or column) with two queens has queens that attack each other. However, if other piecesExpand
  • 9
  • 1
Some results for chessboard separation problems
A π separation number is the minimum number of pawns for which some arrangement of those pawns on the board will produce a board where π has some desired value. Expand
Algorithm Performance For Chessboard Separation Problems
Chessboard separation problems are modifications to classic chessboard problems, such as the N Queens Problem, in which obstacles are placed on the chessboard. This paper focuses on a variation knownExpand
  • 4
  • PDF
Independence and Domination Separation on Chessboard Graphs
A legal placement of Queens is any placement of Queens on an order N chessboard in which any two attacking Queens can be separated by a Pawn. The Queens independence separation number is the minimumExpand
  • 7
  • PDF
Pairs of commutative rings in which all intermediate rings have the same dimension
If n is a nonnegative integer or infinity, and R is a (commutative unital) ring contained in a (commutative unital) ring T, then (R,T) is said to be an n-dimensional pair if every ring S that bothExpand
  • 1
N-queens — 330 References How It All Began One Article to Hold Them All Searchable Online Database
This paper currently (February 4, 2011) contains 330 references (originally in BibTeX format) to articles dealing with or at least touching upon the well-known n-Queens problem. Expand
On Open Ring Pairs Of Commutative Rings
If T is an integral commutative extension of a ring R such that R is an open ring, R[a, b] is a going-down ring for each a, b in T and T is semiquasilocal, then each ring contained between R and T isExpand
  • 5