Hayakawa Hiroki
ABSTRACT
We first investigate parallelization of Rubik's cube optimal solver, especially for acceleration by GPU. To examine its efficacy, we implement a simple solver based on Korf's algorithm, with which CPU and GPU collaborate in IDA* algorithm and a large number of GPU cores are utilized for speedup instead of a huge distance table used for pruning. Empirical studies succeeded to attain sufficient speedup by GPU-acceleration.
There are many other similar puzzles of so-called permutation puzzles. The puzzle solving, i.e., restoring the original ordered state from a scrambled one is equivalent to the path-finding in the Cayley graph of the permutation group. We generalize the method used for Rubik's cube to much smaller problems, and examine its efficacy. The focus of our research interest is how efficient the parallel path-finding can be and whether the use of a large number of cores substitutes for a large distance table used for pruning, in general.
- God's number is 20. http://cube20.org/.Google Scholar
- A. H. Frey, Jr. and D. Singmaster. Handbook of Cubik Math. Lutterworth Press, 2010.Google Scholar
- R. Inam. A* algorithm for multicore graphics processors. Master's thesis, Chalmers University of Technology, 2010.Google Scholar
- D. Joyner. Adventures in Group Theory. Johns Hopkins University Press, 2nd edition, 2008.Google Scholar
- H. Kociemba. The two-phase algorithm. http://kociemba.org/twophase.htm.Google Scholar
- R. E. Korf. Depth-first iterative-deepening: An optimal admissible tree search. Artificial Intelligence, 27:97--109, 1985. Google ScholarDigital Library
- R. E. Korf. Finding optimal solutions to Rubik's cube using pattern databases. In Proceedings of National Conference on Artificial Intelligence: AAAI-97, pages 700--705, 1997. Google ScholarDigital Library
- D. Kunkle and C. Cooperman. Twenty-six moves suffice for Rubik's cube. In Proc. ISSAC'07, pages 235--242. ACM Press, 2007. Google ScholarDigital Library
- B. Mahafzah. Parallel multithreaded IDA* heuristic search: algorithm design and performance evalution. International Journal of Parallel Emergent and Distributed Systems, 26(1):61--82, 2011. Google ScholarDigital Library
- M. Reid. Optimal Rubik's cube solver. http://www.cflmath.com/Rubik/optimal_solver.html, 2006.Google Scholar
- A. Reinefeld and V. Schnecke. AIDA* -- asynchronous parallel IDA*. In Proc. 10th Canadian Conf. on AI: AI'94, pages 295--302, 1994.Google Scholar
- T. Rokicki, H. Kociemba, M. Davidson, and J. Dethridge. The diameter of the Rubik's cube group is twenty. SIAM Journal of Discrete Mathematics, 27(2):1082--1105, 2013.Google ScholarCross Ref
- J. Scherphuis. Jaap's Puzzle Page. http://www.jaapsch.net/puzzles/.Google Scholar
- Y. Zhou and J. Zeng. Massively parallel A* search on a GPU. In Proceedings of the 29th AAAI Conference on Artifitial Intelligence, pages 1248--1254, 2015.Google Scholar
Index Terms
- GPU-acceleration of optimal permutation-puzzle solving
Recommendations
Radiation modeling using the Uintah heterogeneous CPU/GPU runtime system
XSEDE '12: Proceedings of the 1st Conference of the Extreme Science and Engineering Discovery Environment: Bridging from the eXtreme to the campus and beyondThe Uintah Computational Framework was developed to provide an environment for solving fluid-structure interaction problems on structured adaptive grids on large-scale, long-running, data-intensive problems. Uintah uses a combination of fluid-flow ...
Neural acceleration for GPU throughput processors
MICRO-48: Proceedings of the 48th International Symposium on MicroarchitectureGraphics Processing Units (GPUs) can accelerate diverse classes of applications, such as recognition, gaming, data analytics, weather prediction, and multimedia. Many of these applications are amenable to approximate execution. This application ...
A sparse octree gravitational N-body code that runs entirely on the GPU processor
We present the implementation and performance of a new gravitational N-body tree-code that is specifically designed for the graphics processing unit (GPU).1The code is publicly available at: http://castle.strw.leidenuniv.nl/software.html.1 All parts of ...
Comments