Pages that link to "Item:Q917310"
From MaRDI portal
The following pages link to The \((n^ 2-1)\)-puzzle and related relocation problems (Q917310):
Displaying 37 items.
- Colored pebble motion on graphs (Q412280) (← links)
- The kissing problem: how to end a gathering when everyone kisses everyone else goodbye (Q489765) (← links)
- \textsc{Snowman} is \(\mathsf{PSPACE}\)-complete (Q526872) (← links)
- Controlling the learning process of real-time heuristic search (Q814454) (← links)
- The transportation problem with conflicts (Q829180) (← links)
- Weighted \(A^*\) search - unifying view and application (Q840833) (← links)
- Tetravex is NP-complete (Q845713) (← links)
- A real-time algorithm for the \((n^{2}-1)\)-puzzle (Q1350227) (← links)
- Trainyard is NP-hard (Q1623273) (← links)
- A simple proof that the \((n^{2} - 1)\)-puzzle is hard (Q1637231) (← links)
- Solving the \((n^2-1)\)-puzzle with \(\frac{8}{3}n^3\) expected moves (Q1736675) (← links)
- Assembling molecules in ATOMIX is hard (Q1885003) (← links)
- Multi-color pebble motion on graphs (Q1957647) (← links)
- Pebble exchange group of graphs (Q2033933) (← links)
- The edge-connectivity of token graphs (Q2045395) (← links)
- Invitation to combinatorial reconfiguration (Q2154076) (← links)
- Wooden geometric puzzles: Design and hardness proofs (Q2272190) (← links)
- Twenty years of progress of \(\mathrm{JCDCG}^3\) (Q2308489) (← links)
- Structural aspects of semigroups based on digraphs (Q2328130) (← links)
- Pebble exchange on graphs (Q2341759) (← links)
- Subdimensional expansion for multirobot path planning (Q2343828) (← links)
- The connectivity of token graphs (Q2413643) (← links)
- Motion planning in Cartesian product graphs (Q2450121) (← links)
- Computational complexity of jumping block puzzles (Q2695336) (← links)
- On reachability in graphs with obstacles (Q2788738) (← links)
- Shortest Reconfiguration of Sliding Tokens on a Caterpillar (Q2803826) (← links)
- Sequentially Swapping Colored Tokens on Graphs (Q2980931) (← links)
- Kernelization of Cycle Packing with Relaxed Disjointness Constraints (Q3174716) (← links)
- Sequentially Swapping Colored Tokens on Graphs (Q4622769) (← links)
- The Fifteen Puzzle—A New Approach (Q4692165) (← links)
- Token Swapping on Trees (Q6045462) (← links)
- Reconfiguration of connected graph partitions (Q6093138) (← links)
- The Maude strategy language (Q6113021) (← links)
- Computational complexity of jumping block puzzles (Q6144017) (← links)
- (Q6179342) (← links)
- Optimally reordering mobile agents on parallel rows (Q6185843) (← links)
- Puzzle and dragons is hard (Q6204537) (← links)
