We present a new mathematical model for tiling finite subsets of Z2 using an arbitrary, but
finite, collection of polyominoes. Unlike previous approaches that employ backtracking and …

Reflections on the N + k Queens Problem Page 1 Reflections on the N + k Queens Problem R.
Douglas Chatham R. Douglas Chatham (d.chatham@moreheadstate.edu) is an associate …

Chessboard separation problems are modifications to classic chessboard problems, such as
the N queens problem, in which obstacles are placed on the chessboard. The N+ k queens …

Understanding and efficiently solving NP-complete problems remains a fundamental
challenge in computational theory (CT). This paper presents XD, a modified Dancing Links …

For a chessboard graph and a given graph parameter π, a π separation number is the
minimum number of pawns for which some arrangement of those pawns on the board will …

For a chessboard graph and a given graph parameter π, a π separation number is the
minimum number of pawns for which some arrangement of those pawns on the board will …

Both independence and independence-separation problems on chessboard graphs have
been studied in detail, with hundreds of papers in the broader independence category, and …