10176

# Permutations, Derangements, and Other Forbidden Position Problems Using Non-Attacking Rooks

A permutation of can be made to correspond to placing mutually non-attacking rooks on an chessboard: if the permutation is , place the rook on the rank and file. (Thinking of a chessboard as a matrix, rank and file mean row and column.) A derangement is a permutation where no element stays in its original position; it corresponds to placing the rooks on the board with the added requirement that the squares on the main diagonal are forbidden. Two other forbidden position problems are illustrated: avoiding the main diagonal and the diagonal just above it, and avoiding the main tridiagonal. In this Demonstration a chessboard consists of white squares, and black squares indicate forbidden positions.

### PERMANENT CITATION

 Share: Embed Interactive Demonstration New! Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site. More details » Download Demonstration as CDF » Download Author Code »(preview ») Files require Wolfram CDF Player or Mathematica.

#### Related Topics

 RELATED RESOURCES
 The #1 tool for creating Demonstrations and anything technical. Explore anything with the first computational knowledge engine. The web's most extensive mathematics resource. An app for every course—right in the palm of your hand. Read our views on math,science, and technology. The format that makes Demonstrations (and any information) easy to share and interact with. Programs & resources for educators, schools & students. Join the initiative for modernizing math education. Walk through homework problems one step at a time, with hints to help along the way. Unlimited random practice problems and answers with built-in Step-by-step solutions. Practice online or make a printable study sheet. Knowledge-based programming for everyone.