"Finding Optimal Solutions to Rubik's Cub e Using Pattern Databases" by Richard E. Korf, AAAI 1997.
The famous "Korf Algorithm" for finding the optimal solution to any Rubik's Cube state.
2 Matching Annotations
- Jan 2023
-
www.cs.princeton.edu www.cs.princeton.edu
- Sep 2015
-
onlinelibrary.wiley.com onlinelibrary.wiley.com
-
Again, though, if maximum recall is required, it is impossible in ranked retrieval to know what is omitted by new queries, whereas Boolean queries allow the user to control and modify the search until a satisfactory result has been achieved and they therefore also seem better suited to iterative searches.
-