Pages that link to "Item:Q1350227"
From MaRDI portal
The following pages link to A real-time algorithm for the \((n^{2}-1)\)-puzzle (Q1350227):
Displaying 6 items.
- Predicting optimal solution costs with bidirectional stratified sampling in regular search spaces (Q901034) (← 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)
- Multi-color pebble motion on graphs (Q1957647) (← links)
- Motion planning in Cartesian product graphs (Q2450121) (← links)
- Puzzle and dragons is hard (Q6204537) (← links)
