Beware of the dog

Image via Wikipedia
Warning signs of this sort have been found in ancient Roman buildings such as the House of the Tragic Poet in Pompeii, which contains a mosaic with the caption "Cave canem". Some suppose that these warnings may sometimes have been intended to prevent visitors from stepping upon small, delicate dogs of the Italian greyhound type.[1]

Law



Notice at Glasgow Necropolis
Under English law, placing such a sign does not relieve the owner of responsibility for any harm which may come to people attacked by the dog

Such signs may be placed to deter burglary even if there is no dog

Eight queens puzzle

Image via Wikipedia
The eight queens puzzle is the problem of placing eight chess queens on an 8×8 chessboard so that no two queens attack 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 2 and 3.

Contents
1 History
2 Constructing a solution
2.1 Solutions to the eight queens puzzle
3 Counting solutions
4 Related problems
5 The eight queens puzzle as an exercise in algorithm design
6 An animated version of the recursive solution
7 Sample program
8 See also
9 References
10 External links
10.1 Links to solutions
[edit]History

The puzzle was originally proposed in 1848 by the chess player Max Bezzel, and over the years, many mathematicians, including Gauss, have worked on this puzzle and its generalized n-queens problem. The first solutions were provided by Franz Nauck in 1850. Nauck also extended the puzzle to n-queens problem (on an n×n board—a chessboard of arbitrary size). In 1874, S. Günther proposed a method of finding solutions by using determinants, and J.W.L. Glaisher refined this approach.

Edsger Dijkstra used this problem in 1972 to illustrate the power of what he called structured programming. He published a highly detailed description of the development of a depth-first backtracking algorithm.2

Constructing a solution

The problem can be quite computationally expensive as there are 4,426,165,368 (i.e., 64 choose 8) possible arrangements of eight queens on a 8×8 board, but only 92 solutions. It is possible to use shortcuts that reduce computational requirements or rules of thumb that avoids brute-force computational techniques. For example, just by applying a simple rule that constrains each queen to a single column (or row), though still considered brute force, it is possible to reduce the number of possibilities to just 16,777,216 (that is, 88) possible combinations. Generating the permutations that are solutions of the eight rooks puzzle[2] and then checking for diagonal attacks further reduces the possibilities to just 40,320 (that is, 8!). The following Python code uses this technique to calculate the 92 solutions