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 6 items.
- 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)
