Pages that link to "Item:Q1637231"
From MaRDI portal
The following pages link to A simple proof that the \((n^{2} - 1)\)-puzzle is hard (Q1637231):
Displaying 14 items.
- Permutation reconstruction from differences (Q463039) (← links)
- A characterization of achievable patterns of the MN-puzzle problem (Q758220) (← links)
- The \((n^ 2-1)\)-puzzle and related relocation problems (Q917310) (← links)
- A real-time algorithm for the \((n^{2}-1)\)-puzzle (Q1350227) (← links)
- How to solve the torus puzzle (Q1736499) (← links)
- Solving the \((n^2-1)\)-puzzle with \(\frac{8}{3}n^3\) expected moves (Q1736675) (← links)
- Invitation to combinatorial reconfiguration (Q2154076) (← links)
- Twenty years of progress of \(\mathrm{JCDCG}^3\) (Q2308489) (← links)
- Computational complexity of jumping block puzzles (Q2695336) (← links)
- (Q6065436) (← links)
- Computational complexity of jumping block puzzles (Q6144017) (← links)
- Puzzle and dragons is hard (Q6204537) (← links)
- Computational complexity of puzzles and related topics (Q6535387) (← links)
- On the diameters of friends-and-strangers graphs (Q6615519) (← links)
