Skip the menu
Spark & Anvil Privacy

InvariantDojo

The study group

  • Halle tries first and logs every attempt that fails, with what was left over.
  • Maeve looks for the count that every move leaves the same.
  • Laszlo counts the swaps and flips and says odd or even.
  • Sigrid counts the lines at each corner of a map. Her bridges task comes later.

A case · you decide

Halle and the forty-first try

Halle & Maeve — a sixteen-year-old in a weekend maths circle

The idea in play: proving a task impossible by finding a count that no move can change.

Halle has spent an hour on a chessboard with two opposite corners cut off, trying to cover it with 31 dominoes. Every try ends with two squares left over.

Her log has forty tries in it. The two leftover squares are never next to each other.

Maeve reads down the log and asks one question: what colour were the two squares left over each time?

What should Halle do next?

Every domino covers one dark square and one light square. What does that tell her?

Try the cut board →

What next? Pick a door

Chosen from what this app is about. What you open is remembered on this device only.