Finding a Shortest Solution for the N × N Extension of the 15-PUZZLE Is Intractable

Daniel Ratner, M. W. (1986). Finding a Shortest Solution for the N × N Extension of the 15-PUZZLE Is Intractable.

Type

Unclassified

Intellectual base

Unclassified

Year

1986

Link

no authoritative link yet

Cited by

1 citation across 1 artifact.

Domain-specific

• 15 puzzle
  • The puzzle has fifteen labeled tiles and one blank; only half of all permutations are reachable from a given state, with solvability determined by permutation parity together with blank-row convention.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:4584f4f73784 · see in the full table