Pages that link to "Item:Q3304120"
From MaRDI portal
The following pages link to Solving the Rubik's Cube Optimally is NP-complete (Q3304120):
Displaying 8 items.
- Algorithms for Solving Rubik’s Cubes (Q3092271) (← links)
- Solving Combinatorial Puzzles with Parallel Evolutionary Algorithms (Q3297733) (← links)
- Generalization of Rubik’s cube group to n-dimensional case (Q5111668) (← links)
- (Q5301676) (← links)
- Solving Rubik’s cube via quantum mechanics and deep reinforcement learning (Q5877956) (← links)
- Computational complexity of puzzles and related topics (Q6535387) (← links)
- On the hardness of Gray code problems for combinatorial objects (Q6575387) (← links)
- Reconfiguring shortest paths in graphs (Q6623589) (← links)