Kowalewski's Settlement Problem for the Rhombic Dodecahedron

Kowalewski's diagram consists of 12 non-overlapping simply connected regions. Each region has four neighboring regions. There are also 12 two-digit labels. The Kowalewski settlement problem is to place the labels on the regions so that the labels of neighboring regions have exactly one common digit.

SNAPSHOTS

  • [Snapshot]
  • [Snapshot]
  • [Snapshot]

DETAILS

Kowalewski's original condition is a little stronger. Two opposing neighboring labels must match the first digit and the other two the second digit. But if a solution with a weak condition is obtained, a solution with a stronger condition can be obtained by swapping some labels by exchanging the digits (e.g. 42 and 24).
Reference
[1] G. Kowalewski and D. Booth, "Construction Games with Kepler's Solid," Austin, TX: Parker Courtney Press, 2001. (Jul 16, 2019) www.zometool.com/content/KowalewskiWeb.pdf.
    • 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 »

Files require Wolfram CDF Player or Mathematica.