Algorithm Search⌘K

Theoremintro

Sliding puzzle solvability criterion

Also called Parity criterion for the 15 puzzle.

A configuration is solvable exactly when the permutation parity matches the blank's row parity, for the odd-width case.

A configuration is solvable exactly when the permutation parity matches the blank's row parity, for the odd-width case.

About this page

The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.

LadderLevelWhat the next level needs
Human proofH0 no proof
  • add a proof in proofs/ (06.5)
LeanL0 no Lean part
  • name a Lean module in the lean field (07)
VisualV0 none
  • add viz/scene.ts or a figure (10)
WritingW0 stub
  • Statement
  • one source with a locator