Knight's tours

Article Abstract:

Knight's tours is a classic chess problem pertaining to instances when a knight must move across the board in such a way that it visits every square only once. The question of which rectangular boards support a closed tour, or when the knight can return to its starting square, is explored.

Chess problems

---

Dances with dodecahedra

Article Abstract:

Karl Schaffer, co-founder of the Stern Dance Ensemble, uses mathematics in creating dances. A particular dance called 'Through the Loop in Search of the Perfect Square' is based on polyhedral string figures and is intended to show relations between geometry and symmetry.

String craft

---

Most-perfect magic squares

Article Abstract:

A discussion is presented of a formula to determine the number of most-perfect squares. Most-perfect squares are a subset of magic squares in which any two-by-two block of adjacent entries sum to identical totals.

Magic squares, Most-Perfect Pandiagonal Magic Squares: Their Construction and Enumeration (Book)

Similar abstracts:

• Abstracts: Glass act. Chain with a brain
• Abstracts: Bending to bar codes. Nanotechnology and the double helix. Diet advice from DNA?
• Abstracts: Back at Mars. Life on Mars: the great debate. At last, company: hints of life on Mars
• Abstracts: Theories. Comparison with experimental results. A method for determining the elastic-plastic response ahead of a notch tip
• Abstracts: Environmental R&D shifts to pollution prevention. Companies signing on to EPA's revamped Project XL program. Enforcement spurs pollution alternatives, EPA report says

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.