10182

# One Disk Per Diagonal

Each diagonal parallel to the main diagonal (which is blank) is colored with one color. The objective is to have exactly one disk on each diagonal, which is equivalent to finding the adjacency matrix of a graceful graph.
Clicking the button in the row and column first swaps the shapes (but not the colors) in rows and , and then swaps the shapes (but not the colors) in columns .

### DETAILS

Graceful[n] generates a -matrix with zero main diagonal and a unique 1 on each of its parallel diagonals. Essentially this is an adjacency matrix of an -edge graceful graph, hence the name.
Snapshot 1 (the rectangles are the 0's and the disks are the 1's): Once the "new game" button is hit, a new matrix is generated. Then we apply a permutation matrix so that the resulting matrix gives a puzzle to solve.
Snapshot 2: Click on a grid element to apply a transposition matrix; this is the effect of Swap[A,i,j]. In the snapshot, we click on position (3,5) or (5,3) to get , where corresponds to the transposition (3,5).
Snapshot 3: Continue the process to get back the "one disk per diagonal" structure. The answer is not unique.

### 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.