n-Queens Task

An n-Queens Task is a constraint satisfaction task of placing [math]\displaystyle{ n\gt math\gt [[chess queen]]s on an \lt math\gt n \times n }[/math] chessboard, such that no two chess queens threaten each other.

• Example(s):
  • an Eight Queens Task.
• See: Chess Board.

---

---

References

2015

• (Wikipedia, 2015) ⇒ http://en.wikipedia.org/wiki/Eight_queens_puzzle Retrieved:2015-12-13.
  • The 'eight queens puzzle is the problem of placing eight chess queens on an 8×8 chessboard so that no two queens threaten each other. Thus, a solution requires that no two queens share the same row, column, or diagonal. The eight queens puzzle is an example of the more general n-queens problem of placing n queens on an n×n chessboard, where solutions exist for all natural numbers n with the exception of n=2 and n=3.

---