pith. sign in

Title resolution pending

· 2024 · DOI 10.1613/jair.1.15249

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
open at publisher browse 1 citing papers

Title metadata for this work has not finished resolving. The hub is built from the citation graph; the title resolver retries DOI and OpenAlex on its next pass.

fields

cs.DM 1

years

2026 1

verdicts

UNVERDICTED 1

representative citing papers

The Optimal Knight Exchange Puzzle is NP-Hard

cs.DM · 2026-06-28 · unverdicted · novelty 6.0

Knight's Tour is NP-hard on connected boards; optimal Knight Exchange is NP-hard by polynomial-time reduction from the tour problem.

citing papers explorer

Showing 1 of 1 citing paper.

  • The Optimal Knight Exchange Puzzle is NP-Hard cs.DM · 2026-06-28 · unverdicted · none · ref 13

    Knight's Tour is NP-hard on connected boards; optimal Knight Exchange is NP-hard by polynomial-time reduction from the tour problem.