# Ron Brown

This image is based on a solution to the knight's tour problem - to move a knight on a chess board so that all 64 squares are jumped on only once. The image was created using Processing. Mathematically, the knight's tour problem is a Hamiltonian problem whereby each node in the 64-node network must be visited exactly once. The knight's tour used to produce the image is the same knight's tour I discussed in my presentation at the Bridges Conference held at Towson University in 2002.

The image is based on this solution to the knight's tour problem:

Row 1: 50 11 24 63 14 37 26 35

Row 2: 23 62 51 12 25 34 15 38

Row 3: 10 49 64 21 40 13 36 27

Row 4: 61 22 09 52 33 28 39 16

Row 5: 48 07 60 01 20 41 54 29

Row 6: 59 04 45 08 53 32 17 42

Row 7: 06 47 02 57 44 19 30 55

Row 8: 03 58 05 46 31 56 43 18

Each cell contains randomly drawn squares based on the number of the cell. For example, location '3' (located at the lower left corner) contains 3 randomly drawn squares.