Search Results for ""

What is the maximum number of queens that can be placed on an n×n chessboard such that no two attack one another? The answer is n-1 queens for n=2 or n=3 and n queens ...

The m×n knight graph is a graph on mn vertices in which each vertex represents a square in an m×n chessboard, and each edge corresponds to a legal move by a knight (which may ...

The m×n queen graph Q_(m,n) is a graph with mn vertices in which each vertex represents a square in an m×n chessboard, and each edge corresponds to a legal move by a queen. ...

Regardless of where one white and one black square are deleted from an ordinary 8×8 chessboard, the reduced board can always be covered exactly with 31 dominoes (of dimension ...

The problem of determining how many nonattacking kings can be placed on an n×n chessboard. For n=8, the solution is 16, as illustrated above (Madachy 1979). In general, the ...

Find the maximum number of bishops B(n) that can be placed on an n×n chessboard such that no two attack each other. The answer is 2n-2 (Dudeney 1970, Madachy 1979), giving ...

In a game proposed by J. H. Conway, a devil chases an angel on an infinite chessboard. At each move, the devil can eliminate one of the squares, and the angel can make a leap ...

A circular pattern obtained by superposing parallel equally spaced lines on a set of concentric circles of increasing radii, then coloring the regions in chessboard fashion. ...

Sprague (1963) considered the problem of "rolling" five cubes, each which an upright letter "A" on its top, on a chessboard. Here "rolling" means the cubes are moved from ...

The rook numbers r_k^((m,n)) of an m×n board are the number of subsets of size k such that no two elements have the same first or second coordinate. In other word, it is the ...